Base | Representation |
---|---|
bin | 10000000010010101111… |
… | …011010101001111001111 |
3 | 10220100112011012100101212 |
4 | 100002111323111033033 |
5 | 121023422402031242 |
6 | 2202133022525035 |
7 | 142422153554012 |
oct | 20022573251717 |
9 | 3810464170355 |
10 | 1102026986447 |
11 | 39540455aa02 |
12 | 1596b673677b |
13 | 7cbc7a10a3a |
14 | 3b4a4789379 |
15 | 1d9ed8e4782 |
hex | 10095ed53cf |
1102026986447 has 2 divisors, whose sum is σ = 1102026986448. Its totient is φ = 1102026986446.
The previous prime is 1102026986429. The next prime is 1102026986461. The reversal of 1102026986447 is 7446896202011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102026986447 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102026986395 and 1102026986404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102026986647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551013493223 + 551013493224.
It is an arithmetic number, because the mean of its divisors is an integer number (551013493224).
Almost surely, 21102026986447 is an apocalyptic number.
1102026986447 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102026986447 is an equidigital number, since it uses as much as digits as its factorization.
1102026986447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1161216, while the sum is 50.
The spelling of 1102026986447 in words is "one trillion, one hundred two billion, twenty-six million, nine hundred eighty-six thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •