Base | Representation |
---|---|
bin | 10000000010011011000… |
… | …000000011110110000111 |
3 | 10220100202002101011201101 |
4 | 100002123000003312013 |
5 | 121024111200041012 |
6 | 2202145303240531 |
7 | 142424236245334 |
oct | 20023300036607 |
9 | 3810662334641 |
10 | 1102112112007 |
11 | 395448612005 |
12 | 15971b149147 |
13 | 7cc0c5470aa |
14 | 3b4b1bc798b |
15 | 1da0610bd57 |
hex | 1009b003d87 |
1102112112007 has 2 divisors, whose sum is σ = 1102112112008. Its totient is φ = 1102112112006.
The previous prime is 1102112112001. The next prime is 1102112112047. The reversal of 1102112112007 is 7002112112011.
It is a weak prime.
It is an emirp because it is prime and its reverse (7002112112011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102112112007 is a prime.
It is a super-2 number, since 2×11021121120072 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102112112001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551056056003 + 551056056004.
It is an arithmetic number, because the mean of its divisors is an integer number (551056056004).
Almost surely, 21102112112007 is an apocalyptic number.
1102112112007 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102112112007 is an equidigital number, since it uses as much as digits as its factorization.
1102112112007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 1102112112007 its reverse (7002112112011), we get a palindrome (8104224224018).
The spelling of 1102112112007 in words is "one trillion, one hundred two billion, one hundred twelve million, one hundred twelve thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •