Base | Representation |
---|---|
bin | 10000001000111011000… |
… | …001111000000101110001 |
3 | 10221000202112002122120012 |
4 | 100020323001320011301 |
5 | 121132410012110001 |
6 | 2205302040424305 |
7 | 143062221454535 |
oct | 20107301700561 |
9 | 3830675078505 |
10 | 1109091910001 |
11 | 3983aa5185a9 |
12 | 15ab48778095 |
13 | 807825c898a |
14 | 3b974ba5bc5 |
15 | 1dcb3c852bb |
hex | 1023b078171 |
1109091910001 has 2 divisors, whose sum is σ = 1109091910002. Its totient is φ = 1109091910000.
The previous prime is 1109091909983. The next prime is 1109091910033. The reversal of 1109091910001 is 1000191909011.
It is an a-pointer prime, because the next prime (1109091910033) can be obtained adding 1109091910001 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 742311480625 + 366780429376 = 861575^2 + 605624^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1109091910001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1109091910001.
It is not a weakly prime, because it can be changed into another prime (1109091910301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 554545955000 + 554545955001.
It is an arithmetic number, because the mean of its divisors is an integer number (554545955001).
Almost surely, 21109091910001 is an apocalyptic number.
It is an amenable number.
1109091910001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1109091910001 is an equidigital number, since it uses as much as digits as its factorization.
1109091910001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 729, while the sum is 32.
The spelling of 1109091910001 in words is "one trillion, one hundred nine billion, ninety-one million, nine hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •