Base | Representation |
---|---|
bin | 100001101001000… |
… | …001001101101111 |
3 | 1110100000112122000 |
4 | 201221001031233 |
5 | 2123441313012 |
6 | 132001023343 |
7 | 16662220662 |
oct | 4151011557 |
9 | 1410015560 |
10 | 564401007 |
11 | 26a653915 |
12 | 139024b53 |
13 | 8cc132c1 |
14 | 54d5b6d9 |
15 | 34839ddc |
hex | 21a4136f |
564401007 has 8 divisors (see below), whose sum is σ = 836149680. Its totient is φ = 376267320.
The previous prime is 564400981. The next prime is 564401011. The reversal of 564401007 is 700104465.
564401007 is a `hidden beast` number, since 5 + 644 + 0 + 10 + 0 + 7 = 666.
It is not a de Polignac number, because 564401007 - 26 = 564400943 is a prime.
It is a super-2 number, since 2×5644010072 = 637096993405228098, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 20903741 = 564401007 / (5 + 6 + 4 + 4 + 0 + 1 + 0 + 0 + 7).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (564401017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10451844 + ... + 10451897.
It is an arithmetic number, because the mean of its divisors is an integer number (104518710).
Almost surely, 2564401007 is an apocalyptic number.
564401007 is a deficient number, since it is larger than the sum of its proper divisors (271748673).
564401007 is a wasteful number, since it uses less digits than its factorization.
564401007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20903750 (or 20903744 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 564401007 is about 23757.1253942896. The cubic root of 564401007 is about 826.4106905781.
The spelling of 564401007 in words is "five hundred sixty-four million, four hundred one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •