Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …000110101101101001001 |
3 | 10220011022122201002122102 |
4 | 100000131300311231021 |
5 | 121010310302014204 |
6 | 2201201004403145 |
7 | 142321203653564 |
oct | 20003560655511 |
9 | 3804278632572 |
10 | 1100010969929 |
11 | 39456a573953 |
12 | 1592335464b5 |
13 | 7c966149461 |
14 | 3b352b214db |
15 | 1d93191b41e |
hex | 1001dc35b49 |
1100010969929 has 2 divisors, whose sum is σ = 1100010969930. Its totient is φ = 1100010969928.
The previous prime is 1100010969923. The next prime is 1100010969989. The reversal of 1100010969929 is 9299690100011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1081491842704 + 18519127225 = 1039948^2 + 136085^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100010969929 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1100010969923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550005484964 + 550005484965.
It is an arithmetic number, because the mean of its divisors is an integer number (550005484965).
Almost surely, 21100010969929 is an apocalyptic number.
It is an amenable number.
1100010969929 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100010969929 is an equidigital number, since it uses as much as digits as its factorization.
1100010969929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78732, while the sum is 47.
The spelling of 1100010969929 in words is "one trillion, one hundred billion, ten million, nine hundred sixty-nine thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •