Base | Representation |
---|---|
bin | 11011101111101001110111… |
… | …010001110000000001100111 |
3 | 121000001012011111221110211012 |
4 | 123233221313101300001213 |
5 | 111443202100114134343 |
6 | 1111304050522132435 |
7 | 34462541312605562 |
oct | 3357516721600147 |
9 | 530035144843735 |
10 | 122022022021223 |
11 | 35975281361535 |
12 | 1182882835111b |
13 | 531182025341c |
14 | 221bc7c5934d9 |
15 | e19115b61718 |
hex | 6efa77470067 |
122022022021223 has 2 divisors, whose sum is σ = 122022022021224. Its totient is φ = 122022022021222.
The previous prime is 122022022021129. The next prime is 122022022021231. The reversal of 122022022021223 is 322120220220221.
It is a strong prime.
It is an emirp because it is prime and its reverse (322120220220221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122022022021223 is a prime.
It is a super-3 number, since 3×1220220220212233 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122022822021223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61011011010611 + 61011011010612.
It is an arithmetic number, because the mean of its divisors is an integer number (61011011010612).
Almost surely, 2122022022021223 is an apocalyptic number.
122022022021223 is a deficient number, since it is larger than the sum of its proper divisors (1).
122022022021223 is an equidigital number, since it uses as much as digits as its factorization.
122022022021223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 122022022021223 its reverse (322120220220221), we get a palindrome (444142242241444).
The spelling of 122022022021223 in words is "one hundred twenty-two trillion, twenty-two billion, twenty-two million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •