Base | Representation |
---|---|
bin | 10010110111101111… |
… | …00000011111001001 |
3 | 222011001122220110201 |
4 | 21123313200133021 |
5 | 131222042242413 |
6 | 4353151012201 |
7 | 506026611622 |
oct | 113367403711 |
9 | 28131586421 |
10 | 10131212233 |
11 | 432989477a |
12 | 1b68b0a061 |
13 | c55c3b94c |
14 | 6c175aa49 |
15 | 3e467a9dd |
hex | 25bde07c9 |
10131212233 has 2 divisors, whose sum is σ = 10131212234. Its totient is φ = 10131212232.
The previous prime is 10131212213. The next prime is 10131212249. The reversal of 10131212233 is 33221213101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7784003529 + 2347208704 = 88227^2 + 48448^2 .
It is a cyclic number.
It is not a de Polignac number, because 10131212233 - 229 = 9594341321 is a prime.
It is a super-2 number, since 2×101312122332 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10131212233.
It is not a weakly prime, because it can be changed into another prime (10131212213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065606116 + 5065606117.
It is an arithmetic number, because the mean of its divisors is an integer number (5065606117).
Almost surely, 210131212233 is an apocalyptic number.
It is an amenable number.
10131212233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131212233 is an equidigital number, since it uses as much as digits as its factorization.
10131212233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10131212233 its reverse (33221213101), we get a palindrome (43352425334).
The spelling of 10131212233 in words is "ten billion, one hundred thirty-one million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •