Base | Representation |
---|---|
bin | 10011000010100100… |
… | …10101110000000101 |
3 | 222101101202010020222 |
4 | 21201102111300011 |
5 | 131413331212404 |
6 | 4410155434125 |
7 | 511212455531 |
oct | 114122256005 |
9 | 28341663228 |
10 | 10222132229 |
11 | 4376144271 |
12 | 1b93455945 |
13 | c6ba2356a |
14 | 6cd866bc1 |
15 | 3ec639dbe |
hex | 261495c05 |
10222132229 has 2 divisors, whose sum is σ = 10222132230. Its totient is φ = 10222132228.
The previous prime is 10222132223. The next prime is 10222132237. The reversal of 10222132229 is 92223122201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8447448100 + 1774684129 = 91910^2 + 42127^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10222132229 is a prime.
It is a super-3 number, since 3×102221322293 (a number of 31 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10222132198 and 10222132207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222132223) 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, 5111066114 + 5111066115.
It is an arithmetic number, because the mean of its divisors is an integer number (5111066115).
Almost surely, 210222132229 is an apocalyptic number.
It is an amenable number.
10222132229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222132229 is an equidigital number, since it uses as much as digits as its factorization.
10222132229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 10222132229 in words is "ten billion, two hundred twenty-two million, one hundred thirty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.338 sec. • engine limits •