Base | Representation |
---|---|
bin | 1001001101000100010110… |
… | …0111110101100011110101 |
3 | 1022211110202221022021111221 |
4 | 2103101011213311203311 |
5 | 2311301441410122102 |
6 | 33305040445030341 |
7 | 2063103533231056 |
oct | 223210547654365 |
9 | 38743687267457 |
10 | 10120111020277 |
11 | 3251a07927335 |
12 | 11754188553b1 |
13 | 58542634445b |
14 | 26db5d0d472d |
15 | 1283a9a28637 |
hex | 934459f58f5 |
10120111020277 has 2 divisors, whose sum is σ = 10120111020278. Its totient is φ = 10120111020276.
The previous prime is 10120111020209. The next prime is 10120111020353. The reversal of 10120111020277 is 77202011102101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10036990670641 + 83120349636 = 3168121^2 + 288306^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120111020277 - 211 = 10120111018229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120211020277) 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, 5060055510138 + 5060055510139.
It is an arithmetic number, because the mean of its divisors is an integer number (5060055510139).
Almost surely, 210120111020277 is an apocalyptic number.
It is an amenable number.
10120111020277 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120111020277 is an equidigital number, since it uses as much as digits as its factorization.
10120111020277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 392, while the sum is 25.
Adding to 10120111020277 its reverse (77202011102101), we get a palindrome (87322122122378).
The spelling of 10120111020277 in words is "ten trillion, one hundred twenty billion, one hundred eleven million, twenty thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •