Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …100101101010011010011001 |
3 | 112102211110101201000212110200 |
4 | 121002022220211222122121 |
5 | 103412334320122023001 |
6 | 1030055130113532413 |
7 | 32122315064445654 |
oct | 3102125045523231 |
9 | 472743351025420 |
10 | 110100020111001 |
11 | 3209917a061a58 |
12 | 10422155b74109 |
13 | 49585060029ab |
14 | 1d28c2591889b |
15 | cade4a5c1086 |
hex | 6422a896a699 |
110100020111001 has 96 divisors (see below), whose sum is σ = 171225499760640. Its totient is φ = 67953865859712.
The previous prime is 110100020110999. The next prime is 110100020111069. The reversal of 110100020111001 is 100111020001011.
It is not a de Polignac number, because 110100020111001 - 21 = 110100020110999 is a prime.
It is a super-2 number, since 2×1101000201110012 (a number of 29 digits) contains 22 as substring.
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 (110100020116001) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 17766661435 + ... + 17766667631.
It is an arithmetic number, because the mean of its divisors is an integer number (1783598955840).
Almost surely, 2110100020111001 is an apocalyptic number.
It is an amenable number.
110100020111001 is a deficient number, since it is larger than the sum of its proper divisors (61125479649639).
110100020111001 is a wasteful number, since it uses less digits than its factorization.
110100020111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9275 (or 9272 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110100020111001 its reverse (100111020001011), we get a palindrome (210211040112012).
The spelling of 110100020111001 in words is "one hundred ten trillion, one hundred billion, twenty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •