Base | Representation |
---|---|
bin | 111100010110000… |
… | …110000110100001 |
3 | 2121120001112011201 |
4 | 330112012012201 |
5 | 4033140100441 |
6 | 244243441201 |
7 | 34042320511 |
oct | 7426060641 |
9 | 2546045151 |
10 | 1012425121 |
11 | 47a53aa84 |
12 | 243086201 |
13 | 13199a826 |
14 | 98663841 |
15 | 5dd37c31 |
hex | 3c5861a1 |
1012425121 has 2 divisors, whose sum is σ = 1012425122. Its totient is φ = 1012425120.
The previous prime is 1012425097. The next prime is 1012425143. The reversal of 1012425121 is 1215242101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 759774096 + 252651025 = 27564^2 + 15895^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012425121 - 27 = 1012424993 is a prime.
It is not a weakly prime, because it can be changed into another prime (1012425721) 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, 506212560 + 506212561.
It is an arithmetic number, because the mean of its divisors is an integer number (506212561).
Almost surely, 21012425121 is an apocalyptic number.
It is an amenable number.
1012425121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012425121 is an equidigital number, since it uses as much as digits as its factorization.
1012425121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 19.
The square root of 1012425121 is about 31818.6285216695. The cubic root of 1012425121 is about 1004.1246707007.
Adding to 1012425121 its reverse (1215242101), we get a palindrome (2227667222).
It can be divided in two parts, 10124 and 25121, that added together give a triangular number (35245 = T265).
The spelling of 1012425121 in words is "one billion, twelve million, four hundred twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •