Base | Representation |
---|---|
bin | 11011110010100011010111… |
… | …111000001010101011011111 |
3 | 121000202020022100112012000012 |
4 | 123302203113320022223133 |
5 | 112004433020031401343 |
6 | 1111535352125353435 |
7 | 34513122356650142 |
oct | 3362432770125337 |
9 | 530666270465005 |
10 | 122221211200223 |
11 | 35a417a7470933 |
12 | 1185b35840887b |
13 | 53275455a1255 |
14 | 2227776ad0059 |
15 | e1e3c2d22718 |
hex | 6f28d7e0aadf |
122221211200223 has 2 divisors, whose sum is σ = 122221211200224. Its totient is φ = 122221211200222.
The previous prime is 122221211200201. The next prime is 122221211200241. The reversal of 122221211200223 is 322002112122221.
It is a strong prime.
It is an emirp because it is prime and its reverse (322002112122221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122221211200223 - 212 = 122221211196127 is a prime.
It is a super-2 number, since 2×1222212112002232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122221211206223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61110605600111 + 61110605600112.
It is an arithmetic number, because the mean of its divisors is an integer number (61110605600112).
Almost surely, 2122221211200223 is an apocalyptic number.
122221211200223 is a deficient number, since it is larger than the sum of its proper divisors (1).
122221211200223 is an equidigital number, since it uses as much as digits as its factorization.
122221211200223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 122221211200223 its reverse (322002112122221), we get a palindrome (444223323322444).
The spelling of 122221211200223 in words is "one hundred twenty-two trillion, two hundred twenty-one billion, two hundred eleven million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •