Base | Representation |
---|---|
bin | 111011100111000… |
… | …111101111001011 |
3 | 2120200212220110001 |
4 | 323213013233023 |
5 | 4022012023201 |
6 | 243123503431 |
7 | 33532542442 |
oct | 7347075713 |
9 | 2520786401 |
10 | 1000111051 |
11 | 47359a265 |
12 | 23ab27b77 |
13 | 12c2788b4 |
14 | 96b79d59 |
15 | 5cc04301 |
hex | 3b9c7bcb |
1000111051 has 2 divisors, whose sum is σ = 1000111052. Its totient is φ = 1000111050.
The previous prime is 1000111039. The next prime is 1000111061. The reversal of 1000111051 is 1501110001.
It is an a-pointer prime, because the next prime (1000111061) can be obtained adding 1000111051 to its sum of digits (10).
It is a strong prime.
It is an emirp because it is prime and its reverse (1501110001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1000111051 - 29 = 1000110539 is a prime.
It is a super-2 number, since 2×10001110512 = 2000444228664649202, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1000111061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500055525 + 500055526.
It is an arithmetic number, because the mean of its divisors is an integer number (500055526).
Almost surely, 21000111051 is an apocalyptic number.
1000111051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000111051 is an equidigital number, since it uses as much as digits as its factorization.
1000111051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 10.
The square root of 1000111051 is about 31624.5324234209. The cubic root of 1000111051 is about 1000.0370156298.
Adding to 1000111051 its reverse (1501110001), we get a palindrome (2501221052).
The spelling of 1000111051 in words is "one billion, one hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •