Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …011101110101011001001 |
3 | 10221010102011122001012000 |
4 | 100021320103232223021 |
5 | 121142011210001301 |
6 | 2205552044141213 |
7 | 143126544211212 |
oct | 20117023565311 |
9 | 3833364561160 |
10 | 1110120000201 |
11 | 398887887a23 |
12 | 15b194b37809 |
13 | 808b75bc784 |
14 | 3ba31546409 |
15 | 1dd24164786 |
hex | 102784eeac9 |
1110120000201 has 16 divisors (see below), whose sum is σ = 1645671820800. Its totient is φ = 739607680944.
The previous prime is 1110120000191. The next prime is 1110120000221. The reversal of 1110120000201 is 1020000210111.
It is a happy number.
It is not a de Polignac number, because 1110120000201 - 25 = 1110120000169 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1110120000221) 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 15 ways as a sum of consecutive naturals, for example, 13076886 + ... + 13161503.
It is an arithmetic number, because the mean of its divisors is an integer number (102854488800).
Almost surely, 21110120000201 is an apocalyptic number.
It is an amenable number.
1110120000201 is a deficient number, since it is larger than the sum of its proper divisors (535551820599).
1110120000201 is a wasteful number, since it uses less digits than its factorization.
1110120000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26239965 (or 26239959 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1110120000201 its reverse (1020000210111), we get a palindrome (2130120210312).
The spelling of 1110120000201 in words is "one trillion, one hundred ten billion, one hundred twenty million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •