Base | Representation |
---|---|
bin | 1001101011011110111001… |
… | …1001011010011011101000 |
3 | 1101200102111102210012000011 |
4 | 2122313232121122123220 |
5 | 2343332103202201324 |
6 | 34345054114021304 |
7 | 2145622245156052 |
oct | 232675631323350 |
9 | 41612442705004 |
10 | 10642633631464 |
11 | 343357426098a |
12 | 123a744577834 |
13 | 5c27996850a3 |
14 | 28b16b6588d2 |
15 | 136c8cabcc94 |
hex | 9adee65a6e8 |
10642633631464 has 32 divisors (see below), whose sum is σ = 20823239891520. Its totient is φ = 5089785123456.
The previous prime is 10642633631449. The next prime is 10642633631537. The reversal of 10642633631464 is 46413633624601.
It is a super-2 number, since 2×106426336314642 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors.
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, 4642924 + ... + 6545380.
It is an arithmetic number, because the mean of its divisors is an integer number (650726246610).
Almost surely, 210642633631464 is an apocalyptic number.
It is an amenable number.
10642633631464 is a deficient number, since it is larger than the sum of its proper divisors (10180606260056).
10642633631464 is a wasteful number, since it uses less digits than its factorization.
10642633631464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1932889 (or 1932885 counting only the distinct ones).
The product of its (nonzero) digits is 4478976, while the sum is 49.
The spelling of 10642633631464 in words is "ten trillion, six hundred forty-two billion, six hundred thirty-three million, six hundred thirty-one thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •