Base | Representation |
---|---|
bin | 11100010101011010… |
… | …11100100100111101 |
3 | 1110021011012021201112 |
4 | 32022231130210331 |
5 | 222123242234404 |
6 | 10553251251405 |
7 | 1045653320615 |
oct | 161255344475 |
9 | 43234167645 |
10 | 15212071229 |
11 | 64a68aa2a3 |
12 | 2b465a9b65 |
13 | 158576b8a4 |
14 | a44469a45 |
15 | 5e075556e |
hex | 38ab5c93d |
15212071229 has 2 divisors, whose sum is σ = 15212071230. Its totient is φ = 15212071228.
The previous prime is 15212071181. The next prime is 15212071243. The reversal of 15212071229 is 92217021251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13049635225 + 2162436004 = 114235^2 + 46502^2 .
It is a cyclic number.
It is not a de Polignac number, because 15212071229 - 224 = 15195294013 is a prime.
It is a super-2 number, since 2×152120712292 (a number of 21 digits) contains 22 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 = 15212071195 and 15212071204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15212071129) 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, 7606035614 + 7606035615.
It is an arithmetic number, because the mean of its divisors is an integer number (7606035615).
Almost surely, 215212071229 is an apocalyptic number.
It is an amenable number.
15212071229 is a deficient number, since it is larger than the sum of its proper divisors (1).
15212071229 is an equidigital number, since it uses as much as digits as its factorization.
15212071229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 32.
The spelling of 15212071229 in words is "fifteen billion, two hundred twelve million, seventy-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •