Base | Representation |
---|---|
bin | 11011110100001000101100… |
… | …111110001110001001000111 |
3 | 121001010122010221100221222121 |
4 | 123310020230332032021013 |
5 | 112013223331314024111 |
6 | 1112101344314310411 |
7 | 34524023522164606 |
oct | 3364105476161107 |
9 | 531118127327877 |
10 | 122330013033031 |
11 | 35a8395a247221 |
12 | 11878461a28407 |
13 | 5334894798c8b |
14 | 222cb38adda3d |
15 | e2213eb42871 |
hex | 6f422cf8e247 |
122330013033031 has 2 divisors, whose sum is σ = 122330013033032. Its totient is φ = 122330013033030.
The previous prime is 122330013032993. The next prime is 122330013033037. The reversal of 122330013033031 is 130330310033221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122330013033031 - 215 = 122330013000263 is a prime.
It is a super-2 number, since 2×1223300130330312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122330013032987 and 122330013033005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122330013033037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61165006516515 + 61165006516516.
It is an arithmetic number, because the mean of its divisors is an integer number (61165006516516).
Almost surely, 2122330013033031 is an apocalyptic number.
122330013033031 is a deficient number, since it is larger than the sum of its proper divisors (1).
122330013033031 is an equidigital number, since it uses as much as digits as its factorization.
122330013033031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 122330013033031 its reverse (130330310033221), we get a palindrome (252660323066252).
The spelling of 122330013033031 in words is "one hundred twenty-two trillion, three hundred thirty billion, thirteen million, thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •