Base | Representation |
---|---|
bin | 11101000110110101011… |
… | …10011010000010000011 |
3 | 10112121102211101010021122 |
4 | 32203122232122002003 |
5 | 112341202103323021 |
6 | 2043235052542455 |
7 | 132153313555145 |
oct | 16433256320203 |
9 | 3477384333248 |
10 | 1000102011011 |
11 | 356160570314 |
12 | 1419b0181a2b |
13 | 7340346479c |
14 | 36595bdcc95 |
15 | 1b0356b6bab |
hex | e8dab9a083 |
1000102011011 has 2 divisors, whose sum is σ = 1000102011012. Its totient is φ = 1000102011010.
The previous prime is 1000102010981. The next prime is 1000102011017. The reversal of 1000102011011 is 1101102010001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1000102011011 - 210 = 1000102009987 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000102011011.
It is not a weakly prime, because it can be changed into another prime (1000102011017) 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, 500051005505 + 500051005506.
It is an arithmetic number, because the mean of its divisors is an integer number (500051005506).
Almost surely, 21000102011011 is an apocalyptic number.
1000102011011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000102011011 is an equidigital number, since it uses as much as digits as its factorization.
1000102011011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1000102011011 its reverse (1101102010001), we get a palindrome (2101204021012).
The spelling of 1000102011011 in words is "one trillion, one hundred two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •