Base | Representation |
---|---|
bin | 10011001111101011… |
… | …00010010111010111 |
3 | 222200001112010000001 |
4 | 21213311202113113 |
5 | 132124444202411 |
6 | 4425123032131 |
7 | 514015511536 |
oct | 114765422727 |
9 | 28601463001 |
10 | 10332022231 |
11 | 4422180253 |
12 | 200420b647 |
13 | c8871a82b |
14 | 7002b031d |
15 | 4070e4dc1 |
hex | 267d625d7 |
10332022231 has 2 divisors, whose sum is σ = 10332022232. Its totient is φ = 10332022230.
The previous prime is 10332022213. The next prime is 10332022279. The reversal of 10332022231 is 13222023301.
Together with previous prime (10332022213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (13222023301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10332022231 - 217 = 10331891159 is a prime.
It is a super-2 number, since 2×103320222312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10332022199 and 10332022208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10332022201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5166011115 + 5166011116.
It is an arithmetic number, because the mean of its divisors is an integer number (5166011116).
Almost surely, 210332022231 is an apocalyptic number.
10332022231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10332022231 is an equidigital number, since it uses as much as digits as its factorization.
10332022231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 10332022231 its reverse (13222023301), we get a palindrome (23554045532).
The spelling of 10332022231 in words is "ten billion, three hundred thirty-two million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •