Base | Representation |
---|---|
bin | 11011110100001001101001… |
… | …001011011001011101010101 |
3 | 121001010201202100000201002222 |
4 | 123310021221023121131111 |
5 | 112013232413404321323 |
6 | 1112102032440112125 |
7 | 34524060535610315 |
oct | 3364115113313525 |
9 | 531121670021088 |
10 | 122331023120213 |
11 | 35a8432842a716 |
12 | 118786a4165645 |
13 | 53349c5b285bb |
14 | 222cbd2d15445 |
15 | e2219d6679c8 |
hex | 6f42692d9755 |
122331023120213 has 8 divisors (see below), whose sum is σ = 123879800782080. Its totient is φ = 120782252550960.
The previous prime is 122331023120161. The next prime is 122331023120281. The reversal of 122331023120213 is 312021320133221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122331023120213 - 216 = 122331023054677 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 (122331023129213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38772443 + ... + 41808663.
It is an arithmetic number, because the mean of its divisors is an integer number (15484975097760).
Almost surely, 2122331023120213 is an apocalyptic number.
It is an amenable number.
122331023120213 is a deficient number, since it is larger than the sum of its proper divisors (1548777661867).
122331023120213 is an equidigital number, since it uses as much as digits as its factorization.
122331023120213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3546307.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 122331023120213 its reverse (312021320133221), we get a palindrome (434352343253434).
The spelling of 122331023120213 in words is "one hundred twenty-two trillion, three hundred thirty-one billion, twenty-three million, one hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •