Base | Representation |
---|---|
bin | 10000000001101010100… |
… | …110100110100100001101 |
3 | 10220021122111111022200211 |
4 | 100001222212212210031 |
5 | 121020430313211414 |
6 | 2201532535522421 |
7 | 142365146445112 |
oct | 20015246464415 |
9 | 3807574438624 |
10 | 1101300132109 |
11 | 395071239541 |
12 | 159533229411 |
13 | 7cb1025b408 |
14 | 3b436020909 |
15 | 1d9a9bba3c4 |
hex | 1006a9a690d |
1101300132109 has 2 divisors, whose sum is σ = 1101300132110. Its totient is φ = 1101300132108.
The previous prime is 1101300132059. The next prime is 1101300132113. The reversal of 1101300132109 is 9012310031011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 695272468900 + 406027663209 = 833830^2 + 637203^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101300132109 - 29 = 1101300131597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101300132109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101300132199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550650066054 + 550650066055.
It is an arithmetic number, because the mean of its divisors is an integer number (550650066055).
Almost surely, 21101300132109 is an apocalyptic number.
It is an amenable number.
1101300132109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101300132109 is an equidigital number, since it uses as much as digits as its factorization.
1101300132109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 22.
The spelling of 1101300132109 in words is "one trillion, one hundred one billion, three hundred million, one hundred thirty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •