Base | Representation |
---|---|
bin | 11011110010011010111010… |
… | …000100100111010101000111 |
3 | 121000201100211212002221200021 |
4 | 123302122322010213111013 |
5 | 112004310411012242411 |
6 | 1111531250131400011 |
7 | 34512351202223341 |
oct | 3362327204472507 |
9 | 530640755087607 |
10 | 122212121212231 |
11 | 35a389623a7366 |
12 | 11859640153007 |
13 | 53267272a462b |
14 | 2227153772291 |
15 | e1e03ecbca71 |
hex | 6f26ba127547 |
122212121212231 has 2 divisors, whose sum is σ = 122212121212232. Its totient is φ = 122212121212230.
The previous prime is 122212121212211. The next prime is 122212121212331. The reversal of 122212121212231 is 132212121212221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122212121212231 - 25 = 122212121212199 is a prime.
It is a super-2 number, since 2×1222121212122312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122212121212196 and 122212121212205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122212121212211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61106060606115 + 61106060606116.
It is an arithmetic number, because the mean of its divisors is an integer number (61106060606116).
Almost surely, 2122212121212231 is an apocalyptic number.
122212121212231 is a deficient number, since it is larger than the sum of its proper divisors (1).
122212121212231 is an equidigital number, since it uses as much as digits as its factorization.
122212121212231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 768, while the sum is 25.
Adding to 122212121212231 its reverse (132212121212221), we get a palindrome (254424242424452).
The spelling of 122212121212231 in words is "one hundred twenty-two trillion, two hundred twelve billion, one hundred twenty-one million, two hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •