Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1110000000111011000001 |
3 | 1022210121021202000100110221 |
4 | 2103020213032000323001 |
5 | 2311124322304000001 |
6 | 33300533452023041 |
7 | 2062332164311522 |
oct | 223104716007301 |
9 | 38717252010427 |
10 | 10111011000001 |
11 | 324906813041a |
12 | 11736b9161a81 |
13 | 584605c44382 |
14 | 26d5386c4849 |
15 | 128025b911a1 |
hex | 93227380ec1 |
10111011000001 has 2 divisors, whose sum is σ = 10111011000002. Its totient is φ = 10111011000000.
The previous prime is 10111010999989. The next prime is 10111011000059. The reversal of 10111011000001 is 10000011011101.
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., 9848048185600 + 262962814401 = 3138160^2 + 512799^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111011000001 - 217 = 10111010868929 is a prime.
It is not a weakly prime, because it can be changed into another prime (10111011003001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055505500000 + 5055505500001.
It is an arithmetic number, because the mean of its divisors is an integer number (5055505500001).
Almost surely, 210111011000001 is an apocalyptic number.
It is an amenable number.
10111011000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111011000001 is an equidigital number, since it uses as much as digits as its factorization.
10111011000001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10111011000001 its reverse (10000011011101), we get a palindrome (20111022011102).
It can be divided in two parts, 1011101 and 1000001, that multiplied together give a palindrome (1011102011101).
The spelling of 10111011000001 in words is "ten trillion, one hundred eleven billion, eleven million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •