Base | Representation |
---|---|
bin | 11011110011111111011111… |
… | …111001011100110101111101 |
3 | 121001002200122011200222112102 |
4 | 123303333133321130311331 |
5 | 112013043111240033201 |
6 | 1112053031510514445 |
7 | 34523223564622130 |
oct | 3363773771346575 |
9 | 531080564628472 |
10 | 122320130002301 |
11 | 35a7a748563a30 |
12 | 11876564065a25 |
13 | 533397b0b40ba |
14 | 222c47c308217 |
15 | e21c6218c26b |
hex | 6f3fdfe5cd7d |
122320130002301 has 32 divisors (see below), whose sum is σ = 152602035056640. Its totient is φ = 95252514033600.
The previous prime is 122320130002267. The next prime is 122320130002303. The reversal of 122320130002301 is 103200031023221.
It is a de Polignac number, because none of the positive numbers 2k-122320130002301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122320130002303) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1394092490 + ... + 1394180228.
It is an arithmetic number, because the mean of its divisors is an integer number (4768813595520).
Almost surely, 2122320130002301 is an apocalyptic number.
122320130002301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122320130002301 is a deficient number, since it is larger than the sum of its proper divisors (30281905054339).
122320130002301 is a wasteful number, since it uses less digits than its factorization.
122320130002301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99305.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122320130002301 its reverse (103200031023221), we get a palindrome (225520161025522).
The spelling of 122320130002301 in words is "one hundred twenty-two trillion, three hundred twenty billion, one hundred thirty million, two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •