Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …111111001110011100001 |
3 | 10221010100221011201100002 |
4 | 100021313033321303201 |
5 | 121141442132020001 |
6 | 2205550211105345 |
7 | 143126240115665 |
oct | 20116717716341 |
9 | 3833327151302 |
10 | 1110102220001 |
11 | 398878843445 |
12 | 15b18aba2255 |
13 | 808b3a05848 |
14 | 3ba2d0388a5 |
15 | 1dd2280146b |
hex | 102773f9ce1 |
1110102220001 has 2 divisors, whose sum is σ = 1110102220002. Its totient is φ = 1110102220000.
The previous prime is 1110102219997. The next prime is 1110102220009. The reversal of 1110102220001 is 1000222010111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1109609424400 + 492795601 = 1053380^2 + 22199^2 .
It is an emirp because it is prime and its reverse (1000222010111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110102220001 - 22 = 1110102219997 is a prime.
It is a super-2 number, since 2×11101022200012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110102220009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555051110000 + 555051110001.
It is an arithmetic number, because the mean of its divisors is an integer number (555051110001).
Almost surely, 21110102220001 is an apocalyptic number.
It is an amenable number.
1110102220001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110102220001 is an equidigital number, since it uses as much as digits as its factorization.
1110102220001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1110102220001 its reverse (1000222010111), we get a palindrome (2110324230112).
The spelling of 1110102220001 in words is "one trillion, one hundred ten billion, one hundred two million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •