Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …011001110101111001011 |
3 | 10220011021222011012201102 |
4 | 100000131023032233023 |
5 | 121010300241022422 |
6 | 2201200013212015 |
7 | 142321024112402 |
oct | 20003513165713 |
9 | 3804258135642 |
10 | 1100001110987 |
11 | 394564a4a769 |
12 | 15923019100b |
13 | 7c9640a6b6c |
14 | 3b3516b6639 |
15 | 1d930b20192 |
hex | 1001d2cebcb |
1100001110987 has 2 divisors, whose sum is σ = 1100001110988. Its totient is φ = 1100001110986.
The previous prime is 1100001110933. The next prime is 1100001111029. The reversal of 1100001110987 is 7890111000011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100001110987 - 28 = 1100001110731 is a prime.
It is a super-2 number, since 2×11000011109872 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100001110927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550000555493 + 550000555494.
It is an arithmetic number, because the mean of its divisors is an integer number (550000555494).
Almost surely, 21100001110987 is an apocalyptic number.
1100001110987 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100001110987 is an equidigital number, since it uses as much as digits as its factorization.
1100001110987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 29.
Adding to 1100001110987 its reverse (7890111000011), we get a palindrome (8990112110998).
The spelling of 1100001110987 in words is "one trillion, one hundred billion, one million, one hundred ten thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.220 sec. • engine limits •