Base | Representation |
---|---|
bin | 10011001101010011… |
… | …01001111010101101 |
3 | 222121200002111021221 |
4 | 21212221221322231 |
5 | 132104401131341 |
6 | 4423132423341 |
7 | 513354442411 |
oct | 114651517255 |
9 | 28550074257 |
10 | 10312130221 |
11 | 4411a24078 |
12 | 1bb9617b51 |
13 | c84574603 |
14 | 6db7b2d41 |
15 | 4054b5ed1 |
hex | 266a69ead |
10312130221 has 2 divisors, whose sum is σ = 10312130222. Its totient is φ = 10312130220.
The previous prime is 10312130219. The next prime is 10312130233. The reversal of 10312130221 is 12203121301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7050121225 + 3262008996 = 83965^2 + 57114^2 .
It is a cyclic number.
It is not a de Polignac number, because 10312130221 - 21 = 10312130219 is a prime.
Together with 10312130219, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10312130195 and 10312130204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10312130321) 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, 5156065110 + 5156065111.
It is an arithmetic number, because the mean of its divisors is an integer number (5156065111).
Almost surely, 210312130221 is an apocalyptic number.
It is an amenable number.
10312130221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312130221 is an equidigital number, since it uses as much as digits as its factorization.
10312130221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10312130221 its reverse (12203121301), we get a palindrome (22515251522).
The spelling of 10312130221 in words is "ten billion, three hundred twelve million, one hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •