Base | Representation |
---|---|
bin | 10111000000110100001011… |
… | …101110010001100100101111 |
3 | 111021100200112122112101110221 |
4 | 113000310023232101210233 |
5 | 101231220313324311343 |
6 | 555131423220312211 |
7 | 30214155301651501 |
oct | 2700641356214457 |
9 | 437320478471427 |
10 | 101211101010223 |
11 | 2a281428a52586 |
12 | b427480b42667 |
13 | 4462220563849 |
14 | 1adc9017c1d71 |
15 | ba7aedd4d5ed |
hex | 5c0d0bb9192f |
101211101010223 has 2 divisors, whose sum is σ = 101211101010224. Its totient is φ = 101211101010222.
The previous prime is 101211101010179. The next prime is 101211101010233. The reversal of 101211101010223 is 322010101112101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101211101010223 - 217 = 101211100879151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101211101010197 and 101211101010206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101211101010233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605550505111 + 50605550505112.
It is an arithmetic number, because the mean of its divisors is an integer number (50605550505112).
Almost surely, 2101211101010223 is an apocalyptic number.
101211101010223 is a deficient number, since it is larger than the sum of its proper divisors (1).
101211101010223 is an equidigital number, since it uses as much as digits as its factorization.
101211101010223 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 101211101010223 its reverse (322010101112101), we get a palindrome (423221202122324).
The spelling of 101211101010223 in words is "one hundred one trillion, two hundred eleven billion, one hundred one million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •