Base | Representation |
---|---|
bin | 11011110001000101000111… |
… | …111100010001100110010111 |
3 | 121000101120002121120202112001 |
4 | 123301011013330101212113 |
5 | 112001303241100011411 |
6 | 1111421054205540131 |
7 | 34502610512613352 |
oct | 3361050774214627 |
9 | 530346077522461 |
10 | 122120012110231 |
11 | 35a028961a0773 |
12 | 11843814b74647 |
13 | 531ab38528605 |
14 | 22228d66d9299 |
15 | e1b94d6cbdc1 |
hex | 6f1147f11997 |
122120012110231 has 2 divisors, whose sum is σ = 122120012110232. Its totient is φ = 122120012110230.
The previous prime is 122120012110211. The next prime is 122120012110249. The reversal of 122120012110231 is 132011210021221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122120012110231 - 25 = 122120012110199 is a prime.
It is a super-2 number, since 2×1221200121102312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122120012110199 and 122120012110208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122120012110211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61060006055115 + 61060006055116.
It is an arithmetic number, because the mean of its divisors is an integer number (61060006055116).
Almost surely, 2122120012110231 is an apocalyptic number.
122120012110231 is a deficient number, since it is larger than the sum of its proper divisors (1).
122120012110231 is an equidigital number, since it uses as much as digits as its factorization.
122120012110231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 122120012110231 its reverse (132011210021221), we get a palindrome (254131222131452).
The spelling of 122120012110231 in words is "one hundred twenty-two trillion, one hundred twenty billion, twelve million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •