Properties of the Number 1504

One Thousand Five Hundred Four

Basics

Value: 1503 → 1504 → 1505

Parity: even

Prime: No

Previous Prime: 1499

Next Prime: 1511

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁵ × 47

Divisors: 1, 2, 4, 8, 16, 32, 47, 94, 188, 376

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10111100000

Octal: 2740

Duodecimal: A54

Hexadecimal: 5e0

Square: 2262016

Square Root: 38.781438859330635

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of (w,x,y) such that w,x,y are all in {0,...,n} and |w-x| = |x-y|. A212959

Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers). A71395

Primitive nondeficient numbers. A6039

Number of partitions of n such that the successive differences of consecutive parts are nondecreasing. A240026

Numbers with an even number of prime factors (counted with multiplicity) that cannot be factored into distinct semiprimes. A320892

Number of integer partitions of n whose distinct parts are pairwise indivisible. A305148

Numbers n whose abundance is 16. A141547

Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; T(2,1)=2; for n >= 3 and 1<=k<=n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if 1<=k<=(n-1)/2, else T(n,k) = T(n-1,k-1) + T(n-1,k). A26769

Number of integer compositions of 2n whose half-alternating sum is 0. A357641

Abundant numbers n for which the abundance d = σ(n) - 2·n is a proper divisor, that is, 0 < d < n and d | n. A181595