Base | Representation |
---|---|
bin | 111000110110110111… |
… | …1101100000110000101 |
3 | 102200011101021000111022 |
4 | 1301231233230012011 |
5 | 4000030134132323 |
6 | 132031521120525 |
7 | 11551521305321 |
oct | 1615557540605 |
9 | 380141230438 |
10 | 122100302213 |
11 | 4786748a27a |
12 | 1b7b7189145 |
13 | b68b37c946 |
14 | 5ca4270981 |
15 | 329957c4c8 |
hex | 1c6dbec185 |
122100302213 has 2 divisors, whose sum is σ = 122100302214. Its totient is φ = 122100302212.
The previous prime is 122100302209. The next prime is 122100302287. The reversal of 122100302213 is 312203001221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64654758529 + 57445543684 = 254273^2 + 239678^2 .
It is an emirp because it is prime and its reverse (312203001221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122100302213 - 22 = 122100302209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122100302191 and 122100302200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122100302413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61050151106 + 61050151107.
It is an arithmetic number, because the mean of its divisors is an integer number (61050151107).
Almost surely, 2122100302213 is an apocalyptic number.
It is an amenable number.
122100302213 is a deficient number, since it is larger than the sum of its proper divisors (1).
122100302213 is an equidigital number, since it uses as much as digits as its factorization.
122100302213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 122100302213 its reverse (312203001221), we get a palindrome (434303303434).
The spelling of 122100302213 in words is "one hundred twenty-two billion, one hundred million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •