Base | Representation |
---|---|
bin | 110011010100001101… |
… | …1101000111011001001 |
3 | 101112110000202001001221 |
4 | 1212220123220323021 |
5 | 3301142200001301 |
6 | 122343012242041 |
7 | 10650600355264 |
oct | 1465033507311 |
9 | 345400661057 |
10 | 110200000201 |
11 | 42810033235 |
12 | 19435910321 |
13 | a512a84315 |
14 | 54959a5cdb |
15 | 2cee951da1 |
hex | 19a86e8ec9 |
110200000201 has 8 divisors (see below), whose sum is σ = 117286928424. Its totient is φ = 103180247040.
The previous prime is 110200000193. The next prime is 110200000217. The reversal of 110200000201 is 102000002011.
It can be written as a sum of positive squares in 4 ways, for example, as 317694976 + 109882305225 = 17824^2 + 331485^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110200000201 - 23 = 110200000193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110200000231) 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 7 ways as a sum of consecutive naturals, for example, 16790380 + ... + 16796941.
It is an arithmetic number, because the mean of its divisors is an integer number (14660866053).
Almost surely, 2110200000201 is an apocalyptic number.
It is an amenable number.
110200000201 is a deficient number, since it is larger than the sum of its proper divisors (7086928223).
110200000201 is a wasteful number, since it uses less digits than its factorization.
110200000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33587531.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 110200000201 its reverse (102000002011), we get a palindrome (212200002212).
The spelling of 110200000201 in words is "one hundred ten billion, two hundred million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •