Base | Representation |
---|---|
bin | 111100010100111… |
… | …100110110111001 |
3 | 2121112111021122022 |
4 | 330110330312321 |
5 | 4033101000423 |
6 | 244233204225 |
7 | 34036631036 |
oct | 7424746671 |
9 | 2545437568 |
10 | 1012125113 |
11 | 47a35563a |
12 | 242b60675 |
13 | 1318c40cc |
14 | 985c638d |
15 | 5dcc8dc8 |
hex | 3c53cdb9 |
1012125113 has 2 divisors, whose sum is σ = 1012125114. Its totient is φ = 1012125112.
The previous prime is 1012125083. The next prime is 1012125131. The reversal of 1012125113 is 3115212101.
Together with next prime (1012125131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 585785209 + 426339904 = 24203^2 + 20648^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012125113 - 222 = 1007930809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012125091 and 1012125100.
It is not a weakly prime, because it can be changed into another prime (1012121113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506062556 + 506062557.
It is an arithmetic number, because the mean of its divisors is an integer number (506062557).
Almost surely, 21012125113 is an apocalyptic number.
It is an amenable number.
1012125113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012125113 is an equidigital number, since it uses as much as digits as its factorization.
1012125113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 1012125113 is about 31813.9138271292. The cubic root of 1012125113 is about 1004.0254781157.
Adding to 1012125113 its reverse (3115212101), we get a palindrome (4127337214).
The spelling of 1012125113 in words is "one billion, twelve million, one hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •