Base | Representation |
---|---|
bin | 11001000011100111101111… |
… | …111010111000000010110001 |
3 | 112110012000110112220110021100 |
4 | 121003213233322320002301 |
5 | 103421004100240231001 |
6 | 1030213103121315013 |
7 | 32132454521033436 |
oct | 3103475772700261 |
9 | 473160415813240 |
10 | 110200001102001 |
11 | 32127615794338 |
12 | 104395b9495a69 |
13 | 4964a7a8b80b5 |
14 | 1d2d9cc22bb8d |
15 | cb184cd03586 |
hex | 6439efeb80b1 |
110200001102001 has 24 divisors (see below), whose sum is σ = 159860456664480. Its totient is φ = 73151670211200.
The previous prime is 110200001101991. The next prime is 110200001102021. The reversal of 110200001102001 is 100201100002011.
It is a happy number.
It is not a de Polignac number, because 110200001102001 - 26 = 110200001101937 is a prime.
It is a super-2 number, since 2×1102000011020012 (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 (110200001102021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12117790 + ... + 19163528.
It is an arithmetic number, because the mean of its divisors is an integer number (6660852361020).
Almost surely, 2110200001102001 is an apocalyptic number.
It is an amenable number.
110200001102001 is a deficient number, since it is larger than the sum of its proper divisors (49660455562479).
110200001102001 is a wasteful number, since it uses less digits than its factorization.
110200001102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7053197 (or 7053194 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110200001102001 its reverse (100201100002011), we get a palindrome (210401101104012).
The spelling of 110200001102001 in words is "one hundred ten trillion, two hundred billion, one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •