Base | Representation |
---|---|
bin | 10111001111011000011101… |
… | …110100111101000100110011 |
3 | 111101220101101020012011220221 |
4 | 113033120131310331010303 |
5 | 101344120421311143443 |
6 | 1001215334423313511 |
7 | 30346403630046100 |
oct | 2717303564750463 |
9 | 441811336164827 |
10 | 102212132131123 |
11 | 2a627a15a17903 |
12 | b5694902ab897 |
13 | 45057413447a1 |
14 | 1b35144b57aa7 |
15 | bc3b8ad91eed |
hex | 5cf61dd3d133 |
102212132131123 has 12 divisors (see below), whose sum is σ = 119433010267200. Its totient is φ = 87217527215952.
The previous prime is 102212132131093. The next prime is 102212132131201. The reversal of 102212132131123 is 321131231212201.
It is not a de Polignac number, because 102212132131123 - 29 = 102212132130611 is a prime.
It is a super-2 number, since 2×1022121321311232 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102212132131423) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4677033648 + ... + 4677055501.
It is an arithmetic number, because the mean of its divisors is an integer number (9952750855600).
Almost surely, 2102212132131123 is an apocalyptic number.
102212132131123 is a deficient number, since it is larger than the sum of its proper divisors (17220878136077).
102212132131123 is an equidigital number, since it uses as much as digits as its factorization.
102212132131123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9354089386 (or 9354089379 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 102212132131123 its reverse (321131231212201), we get a palindrome (423343363343324).
The spelling of 102212132131123 in words is "one hundred two trillion, two hundred twelve billion, one hundred thirty-two million, one hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •