Base | Representation |
---|---|
bin | 11101000111101011011… |
… | …10011100010011101001 |
3 | 10112122121101202121102202 |
4 | 32203311232130103221 |
5 | 112343114040131121 |
6 | 2043352034105545 |
7 | 132200454134615 |
oct | 16436556342351 |
9 | 3478541677382 |
10 | 1000555005161 |
11 | 356373241548 |
12 | 141ab7a1b2b5 |
13 | 7347626c26a |
14 | 365da03a345 |
15 | 1b06034740b |
hex | e8f5b9c4e9 |
1000555005161 has 2 divisors, whose sum is σ = 1000555005162. Its totient is φ = 1000555005160.
The previous prime is 1000555005113. The next prime is 1000555005211. The reversal of 1000555005161 is 1615005550001.
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., 828646090000 + 171908915161 = 910300^2 + 414619^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000555005161 - 230 = 999481263337 is a prime.
It is a super-2 number, since 2×10005550051612 (a number of 25 digits) contains 22 as substring.
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 (1000555005361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500277502580 + 500277502581.
It is an arithmetic number, because the mean of its divisors is an integer number (500277502581).
Almost surely, 21000555005161 is an apocalyptic number.
It is an amenable number.
1000555005161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000555005161 is an equidigital number, since it uses as much as digits as its factorization.
1000555005161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 29.
The spelling of 1000555005161 in words is "one trillion, five hundred fifty-five million, five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •