Base | Representation |
---|---|
bin | 10110111101111001000110… |
… | …010010011101000110001111 |
3 | 111020122111000220200100100121 |
4 | 112331321012102131012033 |
5 | 101214422412322011343 |
6 | 554455242101405411 |
7 | 30163514263326064 |
oct | 2675710622350617 |
9 | 436574026610317 |
10 | 101010220110223 |
11 | 2a204214a15156 |
12 | b3b455a409867 |
13 | 44492b88a7888 |
14 | 1ad2cc6716c6b |
15 | ba27933c1aed |
hex | 5bde4649d18f |
101010220110223 has 2 divisors, whose sum is σ = 101010220110224. Its totient is φ = 101010220110222.
The previous prime is 101010220110101. The next prime is 101010220110263. The reversal of 101010220110223 is 322011022010101.
It is a strong prime.
It is an emirp because it is prime and its reverse (322011022010101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101010220110223 - 245 = 65825848021391 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101010220110197 and 101010220110206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101010220110263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505110055111 + 50505110055112.
It is an arithmetic number, because the mean of its divisors is an integer number (50505110055112).
Almost surely, 2101010220110223 is an apocalyptic number.
101010220110223 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010220110223 is an equidigital number, since it uses as much as digits as its factorization.
101010220110223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 101010220110223 its reverse (322011022010101), we get a palindrome (423021242120324).
The spelling of 101010220110223 in words is "one hundred one trillion, ten billion, two hundred twenty million, one hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •