Base | Representation |
---|---|
bin | 1011000110101110100101… |
… | …0010100001101011101101 |
3 | 1121020021200121011111021111 |
4 | 2301223221102201223231 |
5 | 3100023003004044432 |
6 | 41545143221232021 |
7 | 2400105261033631 |
oct | 261535122415355 |
9 | 47207617144244 |
10 | 12210211003117 |
11 | 3988359878856 |
12 | 1452506b62611 |
13 | 6a755833682a |
14 | 302d97c6adc1 |
15 | 162937a32347 |
hex | b1ae94a1aed |
12210211003117 has 2 divisors, whose sum is σ = 12210211003118. Its totient is φ = 12210211003116.
The previous prime is 12210211003099. The next prime is 12210211003259. The reversal of 12210211003117 is 71130011201221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6253970630436 + 5956240372681 = 2500794^2 + 2440541^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12210211003117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210211063117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105105501558 + 6105105501559.
It is an arithmetic number, because the mean of its divisors is an integer number (6105105501559).
Almost surely, 212210211003117 is an apocalyptic number.
It is an amenable number.
12210211003117 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210211003117 is an equidigital number, since it uses as much as digits as its factorization.
12210211003117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 12210211003117 its reverse (71130011201221), we get a palindrome (83340222204338).
The spelling of 12210211003117 in words is "twelve trillion, two hundred ten billion, two hundred eleven million, three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •