Base | Representation |
---|---|
bin | 11011110011111111100000… |
… | …000010010000100100100011 |
3 | 121001002200122100001021221001 |
4 | 123303333200002100210203 |
5 | 112013043112332430311 |
6 | 1112053032032212431 |
7 | 34523223623350033 |
oct | 3363774002204443 |
9 | 531080570037831 |
10 | 122320132311331 |
11 | 35a7a7498a0819 |
12 | 1187656499a117 |
13 | 533397b7120a6 |
14 | 222c47c7498c3 |
15 | e21c624964c1 |
hex | 6f3fe0090923 |
122320132311331 has 2 divisors, whose sum is σ = 122320132311332. Its totient is φ = 122320132311330.
The previous prime is 122320132311319. The next prime is 122320132311439. The reversal of 122320132311331 is 133113231023221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122320132311331 - 211 = 122320132309283 is a prime.
It is a super-2 number, since 2×1223201323113312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122320132311331.
It is not a weakly prime, because it can be changed into another prime (122320132311301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61160066155665 + 61160066155666.
It is an arithmetic number, because the mean of its divisors is an integer number (61160066155666).
Almost surely, 2122320132311331 is an apocalyptic number.
122320132311331 is a deficient number, since it is larger than the sum of its proper divisors (1).
122320132311331 is an equidigital number, since it uses as much as digits as its factorization.
122320132311331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 122320132311331 its reverse (133113231023221), we get a palindrome (255433363334552).
The spelling of 122320132311331 in words is "one hundred twenty-two trillion, three hundred twenty billion, one hundred thirty-two million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •