Base | Representation |
---|---|
bin | 10000011010100100011… |
… | …11001100111000010001 |
3 | 1222220211112221122102111 |
4 | 20031102033030320101 |
5 | 33220103212314101 |
6 | 1111035111145321 |
7 | 55514644400326 |
oct | 10152217147021 |
9 | 1886745848374 |
10 | 564020432401 |
11 | 1a8221914968 |
12 | 91389375241 |
13 | 4125780183a |
14 | 1d427a28b4d |
15 | ea112e5251 |
hex | 83523cce11 |
564020432401 has 8 divisors (see below), whose sum is σ = 569855260800. Its totient is φ = 558186016128.
The previous prime is 564020432359. The next prime is 564020432413. The reversal of 564020432401 is 104234020465.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-564020432401 is a prime.
It is a super-2 number, since 2×5640204324012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (564020435401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3189300 + ... + 3361498.
It is an arithmetic number, because the mean of its divisors is an integer number (71231907600).
Almost surely, 2564020432401 is an apocalyptic number.
It is an amenable number.
564020432401 is a deficient number, since it is larger than the sum of its proper divisors (5834828399).
564020432401 is a wasteful number, since it uses less digits than its factorization.
564020432401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206063.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 564020432401 its reverse (104234020465), we get a palindrome (668254452866).
The spelling of 564020432401 in words is "five hundred sixty-four billion, twenty million, four hundred thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •