Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1010100111101010010101 |
3 | 1022210121021200100010202200 |
4 | 2103020213022213222111 |
5 | 2311124322042010401 |
6 | 33300533420555113 |
7 | 2062332153614205 |
oct | 223104712475225 |
9 | 38717250303680 |
10 | 10111010110101 |
11 | 324906768286a |
12 | 11736b89b2a99 |
13 | 5846059c22c4 |
14 | 26d538532405 |
15 | 128025a67686 |
hex | 932272a7a95 |
10111010110101 has 12 divisors (see below), whose sum is σ = 14915532645312. Its totient is φ = 6597254823336.
The previous prime is 10111010110063. The next prime is 10111010110193. The reversal of 10111010110101 is 10101101011101.
It is not a de Polignac number, because 10111010110101 - 210 = 10111010109077 is a prime.
It is a super-2 number, since 2×101110101101012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111010118101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11951548171 + ... + 11951549016.
It is an arithmetic number, because the mean of its divisors is an integer number (1242961053776).
Almost surely, 210111010110101 is an apocalyptic number.
It is an amenable number.
10111010110101 is a deficient number, since it is larger than the sum of its proper divisors (4804522535211).
10111010110101 is a wasteful number, since it uses less digits than its factorization.
10111010110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23903097240 (or 23903097237 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10111010110101 its reverse (10101101011101), we get a palindrome (20212111121202).
The spelling of 10111010110101 in words is "ten trillion, one hundred eleven billion, ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •