Base | Representation |
---|---|
bin | 11001000011101000110010… |
… | …000101001110100101000001 |
3 | 112110012010022220120210201211 |
4 | 121003220302011032211001 |
5 | 103421013333421041001 |
6 | 1030213405212530121 |
7 | 32132524160000260 |
oct | 3103506205164501 |
9 | 473163286523654 |
10 | 110201111112001 |
11 | 32128035316278 |
12 | 10439869180941 |
13 | 4964bc6862050 |
14 | 1d2da958145d7 |
15 | cb18b54b5351 |
hex | 643a3214e941 |
110201111112001 has 64 divisors (see below), whose sum is σ = 143075441940480. Its totient is φ = 82426862200320.
The previous prime is 110201111111983. The next prime is 110201111112013. The reversal of 110201111112001 is 100211111102011.
It is not a de Polignac number, because 110201111112001 - 211 = 110201111109953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (110201111112401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1807938141 + ... + 1807999093.
It is an arithmetic number, because the mean of its divisors is an integer number (2235553780320).
Almost surely, 2110201111112001 is an apocalyptic number.
It is an amenable number.
110201111112001 is a deficient number, since it is larger than the sum of its proper divisors (32874330828479).
110201111112001 is a wasteful number, since it uses less digits than its factorization.
110201111112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63206.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110201111112001 its reverse (100211111102011), we get a palindrome (210412222214012).
The spelling of 110201111112001 in words is "one hundred ten trillion, two hundred one billion, one hundred eleven million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •