Base | Representation |
---|---|
bin | 11011110101001010111010… |
… | …011001110010010101000011 |
3 | 121001101102122111001111110111 |
4 | 123311022322121302111003 |
5 | 112020404430430321311 |
6 | 1112154142545012151 |
7 | 34532121331530232 |
oct | 3365127231622503 |
9 | 531342574044414 |
10 | 122401105323331 |
11 | 36001020a6814a |
12 | 1188a1a2624057 |
13 | 533b4b42c5043 |
14 | 2232360808b19 |
15 | e23e010b4d21 |
hex | 6f52ba672543 |
122401105323331 has 2 divisors, whose sum is σ = 122401105323332. Its totient is φ = 122401105323330.
The previous prime is 122401105323317. The next prime is 122401105323361. The reversal of 122401105323331 is 133323501104221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122401105323331 - 217 = 122401105192259 is a prime.
It is a super-2 number, since 2×1224011053233312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122401105323293 and 122401105323302.
It is not a weakly prime, because it can be changed into another prime (122401105323361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61200552661665 + 61200552661666.
It is an arithmetic number, because the mean of its divisors is an integer number (61200552661666).
Almost surely, 2122401105323331 is an apocalyptic number.
122401105323331 is a deficient number, since it is larger than the sum of its proper divisors (1).
122401105323331 is an equidigital number, since it uses as much as digits as its factorization.
122401105323331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 122401105323331 its reverse (133323501104221), we get a palindrome (255724606427552).
The spelling of 122401105323331 in words is "one hundred twenty-two trillion, four hundred one billion, one hundred five million, three hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •