Base | Representation |
---|---|
bin | 1110001111100110001001… |
… | …00111000101010011010110 |
3 | 11002220101001222110020200001 |
4 | 13013303010213011103112 |
5 | 13101140331211231402 |
6 | 150341115312041514 |
7 | 6411645214000420 |
oct | 707630447052326 |
9 | 132811058406601 |
10 | 31322200102102 |
11 | 9a86741431568 |
12 | 361a55153329a |
13 | 146289497a280 |
14 | 7a40070c3810 |
15 | 394b67ba7187 |
hex | 1c7cc49c54d6 |
31322200102102 has 32 divisors (see below), whose sum is σ = 57825879031872. Its totient is φ = 12391140288384.
The previous prime is 31322200102097. The next prime is 31322200102103. The reversal of 31322200102102 is 20120100222313.
It is a super-2 number, since 2×313222001021022 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31322200102102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31322200102103) by changing a digit.
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, 73686808 + ... + 74110660.
It is an arithmetic number, because the mean of its divisors is an integer number (1807058719746).
Almost surely, 231322200102102 is an apocalyptic number.
31322200102102 is a deficient number, since it is larger than the sum of its proper divisors (26503678929770).
31322200102102 is a wasteful number, since it uses less digits than its factorization.
31322200102102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 829912.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 31322200102102 its reverse (20120100222313), we get a palindrome (51442300324415).
The spelling of 31322200102102 in words is "thirty-one trillion, three hundred twenty-two billion, two hundred million, one hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •