Base | Representation |
---|---|
bin | 11011110100001000111110… |
… | …110011100100010110111011 |
3 | 121001010122220210100202112002 |
4 | 123310020332303210112323 |
5 | 112013224434412332311 |
6 | 1112101434123211215 |
7 | 34524034114262132 |
oct | 3364107663442673 |
9 | 531118823322462 |
10 | 122330312230331 |
11 | 35a83aa3122617 |
12 | 11878526076b0b |
13 | 53349117755ba |
14 | 222cb66744919 |
15 | e2215b04393b |
hex | 6f423ece45bb |
122330312230331 has 2 divisors, whose sum is σ = 122330312230332. Its totient is φ = 122330312230330.
The previous prime is 122330312230309. The next prime is 122330312230337. The reversal of 122330312230331 is 133032213033221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122330312230331 - 26 = 122330312230267 is a prime.
It is a super-2 number, since 2×1223303122303312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122330312230294 and 122330312230303.
It is not a weakly prime, because it can be changed into another prime (122330312230337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61165156115165 + 61165156115166.
It is an arithmetic number, because the mean of its divisors is an integer number (61165156115166).
Almost surely, 2122330312230331 is an apocalyptic number.
122330312230331 is a deficient number, since it is larger than the sum of its proper divisors (1).
122330312230331 is an equidigital number, since it uses as much as digits as its factorization.
122330312230331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 122330312230331 its reverse (133032213033221), we get a palindrome (255362525263552).
The spelling of 122330312230331 in words is "one hundred twenty-two trillion, three hundred thirty billion, three hundred twelve million, two hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •