Base | Representation |
---|---|
bin | 1110101010000100110011… |
… | …01000110011100010100101 |
3 | 11020010100110100102112221101 |
4 | 13111002121220303202211 |
5 | 13211042130110400401 |
6 | 152315103150520101 |
7 | 6534454211143600 |
oct | 725023150634245 |
9 | 136110410375841 |
10 | 32232012200101 |
11 | a2a757966685a |
12 | 3746943806031 |
13 | 14ca60921400c |
14 | 7d60756b9337 |
15 | 3ad666827101 |
hex | 1d5099a338a5 |
32232012200101 has 24 divisors (see below), whose sum is σ = 41426017479360. Its totient is φ = 24871760952192.
The previous prime is 32232012200099. The next prime is 32232012200137. The reversal of 32232012200101 is 10100221023223.
It is not a de Polignac number, because 32232012200101 - 21 = 32232012200099 is a prime.
It is a super-2 number, since 2×322320122001012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32232012200161) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 841152411 + ... + 841190728.
It is an arithmetic number, because the mean of its divisors is an integer number (1726084061640).
Almost surely, 232232012200101 is an apocalyptic number.
It is an amenable number.
32232012200101 is a deficient number, since it is larger than the sum of its proper divisors (9194005279259).
32232012200101 is a wasteful number, since it uses less digits than its factorization.
32232012200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1682343193 (or 1682343186 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 32232012200101 its reverse (10100221023223), we get a palindrome (42332233223324).
The spelling of 32232012200101 in words is "thirty-two trillion, two hundred thirty-two billion, twelve million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •