Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …101111111101101101001 |
3 | 10220100111011212222222111 |
4 | 100002111011333231221 |
5 | 121023410312122044 |
6 | 2202131403122321 |
7 | 142421623661524 |
oct | 20022505775551 |
9 | 3810434788874 |
10 | 1102013004649 |
11 | 3953a76801a7 |
12 | 1596b1b133a1 |
13 | 7cbc4b5699b |
14 | 3b4a2989bbb |
15 | 1d9ec581b34 |
hex | 1009517fb69 |
1102013004649 has 2 divisors, whose sum is σ = 1102013004650. Its totient is φ = 1102013004648.
The previous prime is 1102013004643. The next prime is 1102013004679. The reversal of 1102013004649 is 9464003102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1079246721424 + 22766283225 = 1038868^2 + 150885^2 .
It is an emirp because it is prime and its reverse (9464003102011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102013004649 is a prime.
It is a super-2 number, since 2×11020130046492 (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 1102013004649.
It is not a weakly prime, because it can be changed into another prime (1102013004643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551006502324 + 551006502325.
It is an arithmetic number, because the mean of its divisors is an integer number (551006502325).
Almost surely, 21102013004649 is an apocalyptic number.
It is an amenable number.
1102013004649 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102013004649 is an equidigital number, since it uses as much as digits as its factorization.
1102013004649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 1102013004649 in words is "one trillion, one hundred two billion, thirteen million, four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •