Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …00111011001010101011 |
3 | 10112121110101102120021102 |
4 | 32203123030323022223 |
5 | 112341211130323201 |
6 | 2043235540232015 |
7 | 132153441554654 |
oct | 16433314731253 |
9 | 3477411376242 |
10 | 1000110011051 |
11 | 356165034918 |
12 | 1419b299b60b |
13 | 73405005c38 |
14 | 36596cc252b |
15 | 1b03624726b |
hex | e8db33b2ab |
1000110011051 has 2 divisors, whose sum is σ = 1000110011052. Its totient is φ = 1000110011050.
The previous prime is 1000110010997. The next prime is 1000110011123. The reversal of 1000110011051 is 1501100110001.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1501100110001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000110011051 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000110011851) 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, 500055005525 + 500055005526.
It is an arithmetic number, because the mean of its divisors is an integer number (500055005526).
Almost surely, 21000110011051 is an apocalyptic number.
1000110011051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000110011051 is an equidigital number, since it uses as much as digits as its factorization.
1000110011051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 1000110011051 its reverse (1501100110001), we get a palindrome (2501210121052).
The spelling of 1000110011051 in words is "one trillion, one hundred ten million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •