Base | Representation |
---|---|
bin | 1001001101110001100000… |
… | …0101101111100101110110 |
3 | 1022212122001200002100201000 |
4 | 2103130120011233211312 |
5 | 2312001302343310402 |
6 | 33314403315544130 |
7 | 2064013104030606 |
oct | 223343005574566 |
9 | 38778050070630 |
10 | 10132232010102 |
11 | 32570679063a4 |
12 | 117783bbbb046 |
13 | 58660858b597 |
14 | 27058cc08c06 |
15 | 128868be7c1c |
hex | 9371816f976 |
10132232010102 has 32 divisors (see below), whose sum is σ = 22516523832960. Its totient is φ = 3377342765160.
The previous prime is 10132232010083. The next prime is 10132232010139. The reversal of 10132232010102 is 20101023223101.
10132232010102 is a `hidden beast` number, since 1 + 0 + 1 + 322 + 320 + 10 + 10 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 861153 + ... + 4583235.
It is an arithmetic number, because the mean of its divisors is an integer number (703641369780).
Almost surely, 210132232010102 is an apocalyptic number.
10132232010102 is an abundant number, since it is smaller than the sum of its proper divisors (12384291822858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10132232010102 is a wasteful number, since it uses less digits than its factorization.
10132232010102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3772505 (or 3772499 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10132232010102 its reverse (20101023223101), we get a palindrome (30233255233203).
The spelling of 10132232010102 in words is "ten trillion, one hundred thirty-two billion, two hundred thirty-two million, ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •