Base | Representation |
---|---|
bin | 111100010101010… |
… | …110110001011101 |
3 | 2121112200200020201 |
4 | 330111112301131 |
5 | 4033112400021 |
6 | 244235343501 |
7 | 34040552356 |
oct | 7425266135 |
9 | 2545620221 |
10 | 1012231261 |
11 | 47a418368 |
12 | 242bb1b91 |
13 | 131930512 |
14 | 98612d2d |
15 | 5dcea591 |
hex | 3c556c5d |
1012231261 has 2 divisors, whose sum is σ = 1012231262. Its totient is φ = 1012231260.
The previous prime is 1012231183. The next prime is 1012231273. The reversal of 1012231261 is 1621322101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 983136025 + 29095236 = 31355^2 + 5394^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012231261 is a prime.
It is a super-2 number, since 2×10122312612 = 2049224251491300242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012231861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506115630 + 506115631.
It is an arithmetic number, because the mean of its divisors is an integer number (506115631).
Almost surely, 21012231261 is an apocalyptic number.
It is an amenable number.
1012231261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012231261 is an equidigital number, since it uses as much as digits as its factorization.
1012231261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 1012231261 is about 31815.5820471668. The cubic root of 1012231261 is about 1004.0605764020.
Adding to 1012231261 its reverse (1621322101), we get a palindrome (2633553362).
The spelling of 1012231261 in words is "one billion, twelve million, two hundred thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •