Base | Representation |
---|---|
bin | 100001110010100010100… |
… | …101001111100111010101 |
3 | 22012222111212111100020011 |
4 | 201302202211033213111 |
5 | 301020434030341432 |
6 | 4534414445040221 |
7 | 326521400306065 |
oct | 41624245174725 |
9 | 8188455440204 |
10 | 2322010012117 |
11 | 815839131a44 |
12 | 316030556071 |
13 | 13ac7030c193 |
14 | 80558c1b3a5 |
15 | 40602ae6847 |
hex | 21ca294f9d5 |
2322010012117 has 2 divisors, whose sum is σ = 2322010012118. Its totient is φ = 2322010012116.
The previous prime is 2322010012103. The next prime is 2322010012123. The reversal of 2322010012117 is 7112100102232.
2322010012117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1905037613361 + 416972398756 = 1380231^2 + 645734^2 .
It is a cyclic number.
It is not a de Polignac number, because 2322010012117 - 219 = 2322009487829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2322010012177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1161005006058 + 1161005006059.
It is an arithmetic number, because the mean of its divisors is an integer number (1161005006059).
Almost surely, 22322010012117 is an apocalyptic number.
It is an amenable number.
2322010012117 is a deficient number, since it is larger than the sum of its proper divisors (1).
2322010012117 is an equidigital number, since it uses as much as digits as its factorization.
2322010012117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 2322010012117 its reverse (7112100102232), we get a palindrome (9434110114349).
The spelling of 2322010012117 in words is "two trillion, three hundred twenty-two billion, ten million, twelve thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •