Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …01011011111101111011 |
3 | 10112201000101021021101021 |
4 | 32210112031123331323 |
5 | 112400223100014042 |
6 | 2043522103203311 |
7 | 132220122415321 |
oct | 16442615337573 |
9 | 3481011237337 |
10 | 1001100001147 |
11 | 356622941054 |
12 | 14202a446537 |
13 | 73532149bac |
14 | 3664c585d11 |
15 | 1b0930ec867 |
hex | e91635bf7b |
1001100001147 has 2 divisors, whose sum is σ = 1001100001148. Its totient is φ = 1001100001146.
The previous prime is 1001100001093. The next prime is 1001100001163. The reversal of 1001100001147 is 7411000011001.
It is a happy number.
It is an a-pointer prime, because the next prime (1001100001163) can be obtained adding 1001100001147 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1001100001147 - 27 = 1001100001019 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1001100001147.
It is not a weakly prime, because it can be changed into another prime (1001100001177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500550000573 + 500550000574.
It is an arithmetic number, because the mean of its divisors is an integer number (500550000574).
Almost surely, 21001100001147 is an apocalyptic number.
1001100001147 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001100001147 is an equidigital number, since it uses as much as digits as its factorization.
1001100001147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 1001100001147 its reverse (7411000011001), we get a palindrome (8412100012148).
The spelling of 1001100001147 in words is "one trillion, one billion, one hundred million, one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •