Base | Representation |
---|---|
bin | 10110110000111110001010… |
… | …001000110110000000011111 |
3 | 111010111121011020201222101201 |
4 | 112300332022020312000133 |
5 | 101110400432323224411 |
6 | 552535314424420331 |
7 | 30042411635605654 |
oct | 2660761210660037 |
9 | 433447136658351 |
10 | 100122300211231 |
11 | 299a16a1317011 |
12 | b2904579176a7 |
13 | 43b3652a4a63c |
14 | 1aa1d3383dc2b |
15 | b896266893c1 |
hex | 5b0f8a23601f |
100122300211231 has 2 divisors, whose sum is σ = 100122300211232. Its totient is φ = 100122300211230.
The previous prime is 100122300211169. The next prime is 100122300211249. The reversal of 100122300211231 is 132112003221001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100122300211231 - 215 = 100122300178463 is a prime.
It is a super-2 number, since 2×1001223002112312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100122300211199 and 100122300211208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100122300211291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061150105615 + 50061150105616.
It is an arithmetic number, because the mean of its divisors is an integer number (50061150105616).
Almost surely, 2100122300211231 is an apocalyptic number.
100122300211231 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122300211231 is an equidigital number, since it uses as much as digits as its factorization.
100122300211231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 100122300211231 its reverse (132112003221001), we get a palindrome (232234303432232).
The spelling of 100122300211231 in words is "one hundred trillion, one hundred twenty-two billion, three hundred million, two hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •