Base | Representation |
---|---|
bin | 10110101111100000110111… |
… | …000011110000011110010111 |
3 | 111010011000120122222201102122 |
4 | 112233200313003300132113 |
5 | 101102230301230333421 |
6 | 552421310100330155 |
7 | 30032234300105201 |
oct | 2657406703603627 |
9 | 433130518881378 |
10 | 100022122121111 |
11 | 299631644031a3 |
12 | b274b5a3a395b |
13 | 43a7079385438 |
14 | 1a9b14cca1771 |
15 | b86c119c22ab |
hex | 5af8370f0797 |
100022122121111 has 2 divisors, whose sum is σ = 100022122121112. Its totient is φ = 100022122121110.
The previous prime is 100022122121101. The next prime is 100022122121143. The reversal of 100022122121111 is 111121221220001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100022122121111 - 222 = 100022117926807 is a prime.
It is a super-2 number, since 2×1000221221211112 (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 100022122121111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100022122121101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50011061060555 + 50011061060556.
It is an arithmetic number, because the mean of its divisors is an integer number (50011061060556).
Almost surely, 2100022122121111 is an apocalyptic number.
100022122121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100022122121111 is an equidigital number, since it uses as much as digits as its factorization.
100022122121111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 100022122121111 its reverse (111121221220001), we get a palindrome (211143343341112).
The spelling of 100022122121111 in words is "one hundred trillion, twenty-two billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •