Base | Representation |
---|---|
bin | 11011101111101000000110… |
… | …000110110000001101101101 |
3 | 121000001000021012012002210121 |
4 | 123233220012012300031231 |
5 | 111443134203032004010 |
6 | 1111303134254204541 |
7 | 34462443256056241 |
oct | 3357500606601555 |
9 | 530030235162717 |
10 | 122020123313005 |
11 | 35974497608995 |
12 | 118283984b3751 |
13 | 53115a9a82838 |
14 | 221bb3c344421 |
15 | e1905410b3da |
hex | 6efa061b036d |
122020123313005 has 8 divisors (see below), whose sum is σ = 146800559669400. Its totient is φ = 97365157521216.
The previous prime is 122020123312939. The next prime is 122020123313047. The reversal of 122020123313005 is 500313321020221.
It can be written as a sum of positive squares in 4 ways, for example, as 36025696583881 + 85994426729124 = 6002141^2 + 9273318^2 .
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 122020123313005 - 211 = 122020123310957 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31367639010 + ... + 31367642899.
It is an arithmetic number, because the mean of its divisors is an integer number (18350069958675).
Almost surely, 2122020123313005 is an apocalyptic number.
It is an amenable number.
122020123313005 is a deficient number, since it is larger than the sum of its proper divisors (24780436356395).
122020123313005 is an equidigital number, since it uses as much as digits as its factorization.
122020123313005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62735282303.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 122020123313005 its reverse (500313321020221), we get a palindrome (622333444333226).
The spelling of 122020123313005 in words is "one hundred twenty-two trillion, twenty billion, one hundred twenty-three million, three hundred thirteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •