Base | Representation |
---|---|
bin | 10111001101111001011110… |
… | …001001011010101101101011 |
3 | 111101112122002122222202221010 |
4 | 113031321132021122231223 |
5 | 101340433022244201443 |
6 | 1001100425211115003 |
7 | 30336133155323031 |
oct | 2715713611325553 |
9 | 441478078882833 |
10 | 102110132022123 |
11 | 2a598733580265 |
12 | b551764742a63 |
13 | 44c8c373501c4 |
14 | 1b3022a210551 |
15 | bc11bb272733 |
hex | 5cde5e25ab6b |
102110132022123 has 16 divisors (see below), whose sum is σ = 136803964953600. Its totient is φ = 67745626992384.
The previous prime is 102110132022103. The next prime is 102110132022127. The reversal of 102110132022123 is 321220231011201.
It is not a de Polignac number, because 102110132022123 - 216 = 102110131956587 is a prime.
It is a super-2 number, since 2×1021101320221232 (a number of 29 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 102110132022123.
It is not an unprimeable number, because it can be changed into a prime (102110132022127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95313523 + ... + 96378876.
It is an arithmetic number, because the mean of its divisors is an integer number (8550247809600).
Almost surely, 2102110132022123 is an apocalyptic number.
102110132022123 is a deficient number, since it is larger than the sum of its proper divisors (34693832931477).
102110132022123 is a wasteful number, since it uses less digits than its factorization.
102110132022123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191693258.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 102110132022123 its reverse (321220231011201), we get a palindrome (423330363033324).
The spelling of 102110132022123 in words is "one hundred two trillion, one hundred ten billion, one hundred thirty-two million, twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •