Base | Representation |
---|---|
bin | 10111000000110110000010… |
… | …111111110111100110010011 |
3 | 111021100212201002221211212002 |
4 | 113000312002333313212103 |
5 | 101231233413120023443 |
6 | 555132353543024215 |
7 | 30214256011020062 |
oct | 2700660277674623 |
9 | 437325632854762 |
10 | 101213102111123 |
11 | 2a282265581282 |
12 | b42793b13b06b |
13 | 446247c005012 |
14 | 1adca514861d9 |
15 | ba7bb987c2b8 |
hex | 5c0d82ff7993 |
101213102111123 has 2 divisors, whose sum is σ = 101213102111124. Its totient is φ = 101213102111122.
The previous prime is 101213102111119. The next prime is 101213102111141. The reversal of 101213102111123 is 321111201312101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101213102111123 - 22 = 101213102111119 is a prime.
It is a super-2 number, since 2×1012131021111232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101213102111095 and 101213102111104.
It is not a weakly prime, because it can be changed into another prime (101213102111153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606551055561 + 50606551055562.
It is an arithmetic number, because the mean of its divisors is an integer number (50606551055562).
Almost surely, 2101213102111123 is an apocalyptic number.
101213102111123 is a deficient number, since it is larger than the sum of its proper divisors (1).
101213102111123 is an equidigital number, since it uses as much as digits as its factorization.
101213102111123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 101213102111123 its reverse (321111201312101), we get a palindrome (422324303423224).
The spelling of 101213102111123 in words is "one hundred one trillion, two hundred thirteen billion, one hundred two million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •