Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …111011010001000110001 |
3 | 10221022021100011010110101 |
4 | 100023220133122020301 |
5 | 121204340020010001 |
6 | 2210502520232401 |
7 | 143224306656616 |
oct | 20135037321061 |
9 | 3838240133411 |
10 | 1112002110001 |
11 | 399663223972 |
12 | 15b61b30b701 |
13 | 80b274cb303 |
14 | 3bb6d4b450d |
15 | 1ddd44dba01 |
hex | 102e87da231 |
1112002110001 has 2 divisors, whose sum is σ = 1112002110002. Its totient is φ = 1112002110000.
The previous prime is 1112002109993. The next prime is 1112002110013. The reversal of 1112002110001 is 1000112002111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1084982640625 + 27019469376 = 1041625^2 + 164376^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112002110001 - 23 = 1112002109993 is a prime.
It is a super-2 number, since 2×11120021100012 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1112002110001.
It is not a weakly prime, because it can be changed into another prime (1112002110031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556001055000 + 556001055001.
It is an arithmetic number, because the mean of its divisors is an integer number (556001055001).
Almost surely, 21112002110001 is an apocalyptic number.
It is an amenable number.
1112002110001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112002110001 is an equidigital number, since it uses as much as digits as its factorization.
1112002110001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1112002110001 its reverse (1000112002111), we get a palindrome (2112114112112).
The spelling of 1112002110001 in words is "one trillion, one hundred twelve billion, two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •