Base | Representation |
---|---|
bin | 11011010101001101000111… |
… | …000100101101101010101001 |
3 | 120202121102200020201100202102 |
4 | 123111031013010231222221 |
5 | 111223412144141143423 |
6 | 1103353054113143145 |
7 | 34214325063501554 |
oct | 3325150704555251 |
9 | 522542606640672 |
10 | 120204442131113 |
11 | 3533446595024a |
12 | 1159451455aab5 |
13 | 520c2cbb406a2 |
14 | 2197cd70b569b |
15 | dd6bd7a86c28 |
hex | 6d534712daa9 |
120204442131113 has 2 divisors, whose sum is σ = 120204442131114. Its totient is φ = 120204442131112.
The previous prime is 120204442131083. The next prime is 120204442131119. The reversal of 120204442131113 is 311131244402021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118804070473984 + 1400371657129 = 10899728^2 + 1183373^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120204442131113 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (120204442131119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60102221065556 + 60102221065557.
It is an arithmetic number, because the mean of its divisors is an integer number (60102221065557).
Almost surely, 2120204442131113 is an apocalyptic number.
It is an amenable number.
120204442131113 is a deficient number, since it is larger than the sum of its proper divisors (1).
120204442131113 is an equidigital number, since it uses as much as digits as its factorization.
120204442131113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 120204442131113 its reverse (311131244402021), we get a palindrome (431335686533134).
The spelling of 120204442131113 in words is "one hundred twenty trillion, two hundred four billion, four hundred forty-two million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •