Base | Representation |
---|---|
bin | 1001001101001000011111… |
… | …0110101110100110111111 |
3 | 1022211120122101020002021111 |
4 | 2103102013312232212333 |
5 | 2311311230342021343 |
6 | 33305343021542451 |
7 | 2063143215252052 |
oct | 223220766564677 |
9 | 38746571202244 |
10 | 10121222220223 |
11 | 32524280a12a4 |
12 | 1175688a14a27 |
13 | 585572616c0a |
14 | 26dc2690aa99 |
15 | 128422372c9d |
hex | 93487dae9bf |
10121222220223 has 2 divisors, whose sum is σ = 10121222220224. Its totient is φ = 10121222220222.
The previous prime is 10121222220211. The next prime is 10121222220257. The reversal of 10121222220223 is 32202222212101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10121222220223 - 29 = 10121222219711 is a prime.
It is a super-2 number, since 2×101212222202232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121222220194 and 10121222220203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10121222220203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060611110111 + 5060611110112.
It is an arithmetic number, because the mean of its divisors is an integer number (5060611110112).
Almost surely, 210121222220223 is an apocalyptic number.
10121222220223 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121222220223 is an equidigital number, since it uses as much as digits as its factorization.
10121222220223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10121222220223 its reverse (32202222212101), we get a palindrome (42323444432324).
The spelling of 10121222220223 in words is "ten trillion, one hundred twenty-one billion, two hundred twenty-two million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •