Base | Representation |
---|---|
bin | 10110110000111110000100… |
… | …111000011011001101111111 |
3 | 111010111120221002210110022021 |
4 | 112300332010320123031333 |
5 | 101110400242234133434 |
6 | 552535301554301011 |
7 | 30042406515161641 |
oct | 2660760470331577 |
9 | 433446832713267 |
10 | 100122212021119 |
11 | 299a1656561522 |
12 | b290432287767 |
13 | 43b363a6b0442 |
14 | 1aa1d25c44891 |
15 | b8961da68cb4 |
hex | 5b0f84e1b37f |
100122212021119 has 2 divisors, whose sum is σ = 100122212021120. Its totient is φ = 100122212021118.
The previous prime is 100122212021059. The next prime is 100122212021141. The reversal of 100122212021119 is 911120212221001.
It is a strong prime.
It is an emirp because it is prime and its reverse (911120212221001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100122212021119 - 243 = 91326118998911 is a prime.
It is a super-2 number, since 2×1001222120211192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100122212021093 and 100122212021102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100122212121119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061106010559 + 50061106010560.
It is an arithmetic number, because the mean of its divisors is an integer number (50061106010560).
Almost surely, 2100122212021119 is an apocalyptic number.
100122212021119 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122212021119 is an equidigital number, since it uses as much as digits as its factorization.
100122212021119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 100122212021119 in words is "one hundred trillion, one hundred twenty-two billion, two hundred twelve million, twenty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •