Base | Representation |
---|---|
bin | 10110111101110000101100… |
… | …101110000101011011110011 |
3 | 111020121121202101000210122121 |
4 | 112331300230232011123303 |
5 | 101214300430002223443 |
6 | 554451151123215111 |
7 | 30163044631052443 |
oct | 2675605456053363 |
9 | 436547671023577 |
10 | 101001201211123 |
11 | 2a200406a95834 |
12 | b3b2861b17497 |
13 | 44484ac23b2a5 |
14 | 1ad26ac9c2123 |
15 | ba24167104ed |
hex | 5bdc2cb856f3 |
101001201211123 has 2 divisors, whose sum is σ = 101001201211124. Its totient is φ = 101001201211122.
The previous prime is 101001201211087. The next prime is 101001201211217. The reversal of 101001201211123 is 321112102100101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101001201211123 - 229 = 101000664340211 is a prime.
It is a super-2 number, since 2×1010012012111232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101001201211097 and 101001201211106.
It is not a weakly prime, because it can be changed into another prime (101001207211123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500600605561 + 50500600605562.
It is an arithmetic number, because the mean of its divisors is an integer number (50500600605562).
Almost surely, 2101001201211123 is an apocalyptic number.
101001201211123 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001201211123 is an equidigital number, since it uses as much as digits as its factorization.
101001201211123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 101001201211123 its reverse (321112102100101), we get a palindrome (422113303311224).
The spelling of 101001201211123 in words is "one hundred one trillion, one billion, two hundred one million, two hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •