Properties of the Number 24064

Twenty-Four Thousand Sixty-Four

Basics

Value: 24063 → 24064 → 24065

Parity: even

Prime: No

Previous Prime: 24061

Next Prime: 24071

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁹ × 47

Divisors: 1, 2, 4, 8, 16, 32, 47, 64, 94, 128

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111000000000

Octal: 57000

Duodecimal: 11B14

Hexadecimal: 5e00

Square: 579076096

Square Root: 155.12575543732254

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 partitions of n-1 boys and one girl with no couple. A120452

Numbers of the form p⁹*q where p and q are distinct primes. A179692

Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 8. A195092

Expansion of e.g.f.: exp(2·x/(1-x)). A52897

Square array read by upward antidiagonals, A(n,k) = ∑_j=0..n (n-j)!*C(n,n-j)* C(n-1,n-j)*k^j, for n>=0 and k>=0. A253286

Expansion of ∏_k>=1 1/(1 - x^k)^k*(k+1*(2·k-1)/2). A279219

Integers with precisely four partitions into sums of four squares of nonnegative numbers. A294282

Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), n>=0, max(0,floor(log₂(n))+1)<=k<=n, read by rows. A335919

Number of integer partitions of n with a unique non-co-mode. A363129

Expansion of e.g.f. exp(-x * (exp(2·x) + 1)). A356815