Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …101111111000111101001 |
3 | 10220100111011212212122102 |
4 | 100002111011333013221 |
5 | 121023410312032332 |
6 | 2202131403103145 |
7 | 142421623651451 |
oct | 20022505770751 |
9 | 3810434785572 |
10 | 1102013002217 |
11 | 3953a7679396 |
12 | 1596b1b11ab5 |
13 | 7cbc4b5584a |
14 | 3b4a2988d61 |
15 | 1d9ec581062 |
hex | 1009517f1e9 |
1102013002217 has 2 divisors, whose sum is σ = 1102013002218. Its totient is φ = 1102013002216.
The previous prime is 1102013002177. The next prime is 1102013002231. The reversal of 1102013002217 is 7122003102011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1067617961536 + 34395040681 = 1033256^2 + 185459^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102013002217 - 228 = 1101744566761 is a prime.
It is not a weakly prime, because it can be changed into another prime (1102013002117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551006501108 + 551006501109.
It is an arithmetic number, because the mean of its divisors is an integer number (551006501109).
Almost surely, 21102013002217 is an apocalyptic number.
It is an amenable number.
1102013002217 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102013002217 is an equidigital number, since it uses as much as digits as its factorization.
1102013002217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 1102013002217 its reverse (7122003102011), we get a palindrome (8224016104228).
The spelling of 1102013002217 in words is "one trillion, one hundred two billion, thirteen million, two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •