Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0011010010011000001 |
3 | 101112012010122222222000 |
4 | 1212202202122103001 |
5 | 3300441341041001 |
6 | 122325120534213 |
7 | 10645260003426 |
oct | 1464242322301 |
9 | 345163588860 |
10 | 110101112001 |
11 | 4276a231051 |
12 | 19408781369 |
13 | a4c843c8aa |
14 | 54867c3d4d |
15 | 2ce5e1ba86 |
hex | 19a289a4c1 |
110101112001 has 32 divisors (see below), whose sum is σ = 168769171200. Its totient is φ = 70856311680.
The previous prime is 110101111999. The next prime is 110101112027. The reversal of 110101112001 is 100211101011.
It is not a de Polignac number, because 110101112001 - 21 = 110101111999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110101112081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5722740 + ... + 5741946.
It is an arithmetic number, because the mean of its divisors is an integer number (5274036600).
Almost surely, 2110101112001 is an apocalyptic number.
It is an amenable number.
110101112001 is a deficient number, since it is larger than the sum of its proper divisors (58668059199).
110101112001 is a wasteful number, since it uses less digits than its factorization.
110101112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26566 (or 26560 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110101112001 its reverse (100211101011), we get a palindrome (210312213012).
The spelling of 110101112001 in words is "one hundred ten billion, one hundred one million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •