Base | Representation |
---|---|
bin | 10000010100111101000… |
… | …000100011100010100111 |
3 | 10222021002210210122001221 |
4 | 100110331000203202213 |
5 | 121340334031120012 |
6 | 2215235544401211 |
7 | 144030311545042 |
oct | 20247500434247 |
9 | 3867083718057 |
10 | 1122010020007 |
11 | 3a2929450878 |
12 | 161552a76207 |
13 | 81a60a27c56 |
14 | 3c43c6d5c59 |
15 | 1e2bce0d507 |
hex | 1053d0238a7 |
1122010020007 has 2 divisors, whose sum is σ = 1122010020008. Its totient is φ = 1122010020006.
The previous prime is 1122010019959. The next prime is 1122010020023. The reversal of 1122010020007 is 7000200102211.
It is an a-pointer prime, because the next prime (1122010020023) can be obtained adding 1122010020007 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1122010020007 - 215 = 1122009987239 is a prime.
It is a super-2 number, since 2×11220100200072 (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 (1122010020077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561005010003 + 561005010004.
It is an arithmetic number, because the mean of its divisors is an integer number (561005010004).
Almost surely, 21122010020007 is an apocalyptic number.
1122010020007 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122010020007 is an equidigital number, since it uses as much as digits as its factorization.
1122010020007 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 16.
Adding to 1122010020007 its reverse (7000200102211), we get a palindrome (8122210122218).
The spelling of 1122010020007 in words is "one trillion, one hundred twenty-two billion, ten million, twenty thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •