Base | Representation |
---|---|
bin | 10011110100101011… |
… | …00011110001000000 |
3 | 1000110200120021010101 |
4 | 21322111203301000 |
5 | 133243424001324 |
6 | 4520011412144 |
7 | 524504651044 |
oct | 117225436100 |
9 | 30420507111 |
10 | 10642406464 |
11 | 45713a7548 |
12 | 2090154054 |
13 | 1007b13041 |
14 | 72d5c8024 |
15 | 4244a5944 |
hex | 27a563c40 |
10642406464 has 56 divisors (see below), whose sum is σ = 22400056800. Its totient is φ = 5002583040.
The previous prime is 10642406447. The next prime is 10642406477. The reversal of 10642406464 is 46460424601.
It is a super-2 number, since 2×106424064642 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125892 + ... + 192700.
Almost surely, 210642406464 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10642406464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11200028400).
10642406464 is an abundant number, since it is smaller than the sum of its proper divisors (11757650336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10642406464 is a wasteful number, since it uses less digits than its factorization.
10642406464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66971 (or 66961 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 37.
The spelling of 10642406464 in words is "ten billion, six hundred forty-two million, four hundred six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •