Base | Representation |
---|---|
bin | 1001000111001111110100… |
… | …1010011111101010111001 |
3 | 1022110220122202212001112201 |
4 | 2101303331022133222321 |
5 | 2303132141421333311 |
6 | 33151101524110201 |
7 | 2052633460142335 |
oct | 221637512375271 |
9 | 38426582761481 |
10 | 10020111121081 |
11 | 321356155aa46 |
12 | 1159b6ab35361 |
13 | 578b7a86b879 |
14 | 268d9409c7c5 |
15 | 1259a580d9c1 |
hex | 91cfd29fab9 |
10020111121081 has 2 divisors, whose sum is σ = 10020111121082. Its totient is φ = 10020111121080.
The previous prime is 10020111121019. The next prime is 10020111121159. The reversal of 10020111121081 is 18012111102001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8547091978681 + 1473019142400 = 2923541^2 + 1213680^2 .
It is a cyclic number.
It is not a de Polignac number, because 10020111121081 - 215 = 10020111088313 is a prime.
It is a super-2 number, since 2×100201111210812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10020111124081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010055560540 + 5010055560541.
It is an arithmetic number, because the mean of its divisors is an integer number (5010055560541).
Almost surely, 210020111121081 is an apocalyptic number.
It is an amenable number.
10020111121081 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020111121081 is an equidigital number, since it uses as much as digits as its factorization.
10020111121081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 10020111121081 its reverse (18012111102001), we get a palindrome (28032222223082).
The spelling of 10020111121081 in words is "ten trillion, twenty billion, one hundred eleven million, one hundred twenty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •