Base | Representation |
---|---|
bin | 1001001101000100011000… |
… | …1010111011100111101101 |
3 | 1022211110210120121200100122 |
4 | 2103101012022323213231 |
5 | 2311302001234021031 |
6 | 33305041414134325 |
7 | 2063104004355611 |
oct | 223210612734755 |
9 | 38743716550318 |
10 | 10120120220141 |
11 | 3251a12040328 |
12 | 117541b9513a5 |
13 | 585428215a69 |
14 | 26db6040b341 |
15 | 1283aa74447b |
hex | 934462bb9ed |
10120120220141 has 2 divisors, whose sum is σ = 10120120220142. Its totient is φ = 10120120220140.
The previous prime is 10120120220053. The next prime is 10120120220153. The reversal of 10120120220141 is 14102202102101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5600014609225 + 4520105610916 = 2366435^2 + 2126054^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120120220141 - 210 = 10120120219117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120120220641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060060110070 + 5060060110071.
It is an arithmetic number, because the mean of its divisors is an integer number (5060060110071).
Almost surely, 210120120220141 is an apocalyptic number.
It is an amenable number.
10120120220141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120120220141 is an equidigital number, since it uses as much as digits as its factorization.
10120120220141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10120120220141 its reverse (14102202102101), we get a palindrome (24222322322242).
The spelling of 10120120220141 in words is "ten trillion, one hundred twenty billion, one hundred twenty million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •