Base | Representation |
---|---|
bin | 111100010000101… |
… | …101001000111101 |
3 | 2121110101201221201 |
4 | 330100231020331 |
5 | 4032304342112 |
6 | 244153255501 |
7 | 34024314211 |
oct | 7420551075 |
9 | 2543351851 |
10 | 1011012157 |
11 | 479765441 |
12 | 242704591 |
13 | 1315c465c |
14 | 983b6941 |
15 | 5db59257 |
hex | 3c42d23d |
1011012157 has 2 divisors, whose sum is σ = 1011012158. Its totient is φ = 1011012156.
The previous prime is 1011012139. The next prime is 1011012229. The reversal of 1011012157 is 7512101101.
1011012157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 923795236 + 87216921 = 30394^2 + 9339^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011012157 - 223 = 1002623549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011015157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505506078 + 505506079.
It is an arithmetic number, because the mean of its divisors is an integer number (505506079).
Almost surely, 21011012157 is an apocalyptic number.
It is an amenable number.
1011012157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011012157 is an equidigital number, since it uses as much as digits as its factorization.
1011012157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70, while the sum is 19.
The square root of 1011012157 is about 31796.4173610802. The cubic root of 1011012157 is about 1003.6573266549.
Adding to 1011012157 its reverse (7512101101), we get a palindrome (8523113258).
The spelling of 1011012157 in words is "one billion, eleven million, twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.648 sec. • engine limits •