Base | Representation |
---|---|
bin | 111100010001001… |
… | …000101110100001 |
3 | 2121110121110221202 |
4 | 330101020232201 |
5 | 4032322001103 |
6 | 244155530545 |
7 | 34025264513 |
oct | 7421105641 |
9 | 2543543852 |
10 | 1011125153 |
11 | 479832325 |
12 | 242759a55 |
13 | 131633c0c |
14 | 98405bb3 |
15 | 5db7c988 |
hex | 3c448ba1 |
1011125153 has 2 divisors, whose sum is σ = 1011125154. Its totient is φ = 1011125152.
The previous prime is 1011125131. The next prime is 1011125161. The reversal of 1011125153 is 3515211101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 700555024 + 310570129 = 26468^2 + 17623^2 .
It is an emirp because it is prime and its reverse (3515211101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011125153 is a prime.
It is not a weakly prime, because it can be changed into another prime (1011125113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505562576 + 505562577.
It is an arithmetic number, because the mean of its divisors is an integer number (505562577).
Almost surely, 21011125153 is an apocalyptic number.
It is an amenable number.
1011125153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011125153 is an equidigital number, since it uses as much as digits as its factorization.
1011125153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 20.
The square root of 1011125153 is about 31798.1941782863. The cubic root of 1011125153 is about 1003.6947165905.
Adding to 1011125153 its reverse (3515211101), we get a palindrome (4526336254).
The spelling of 1011125153 in words is "one billion, eleven million, one hundred twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •