Base | Representation |
---|---|
bin | 110011010010001001… |
… | …0010010111111011001 |
3 | 101112021011212010102201 |
4 | 1212210102102333121 |
5 | 3301021343122301 |
6 | 122332045330201 |
7 | 10646064212263 |
oct | 1464422227731 |
9 | 345234763381 |
10 | 110130442201 |
11 | 4278484428a |
12 | 19416566961 |
13 | a50153ba40 |
14 | 548a65ab33 |
15 | 2ce87b2201 |
hex | 19a4492fd9 |
110130442201 has 8 divisors (see below), whose sum is σ = 118777211784. Its totient is φ = 101508700800.
The previous prime is 110130442157. The next prime is 110130442237. The reversal of 110130442201 is 102244031011.
It can be written as a sum of positive squares in 4 ways, for example, as 56322680976 + 53807761225 = 237324^2 + 231965^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110130442201 - 27 = 110130442073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110130442291) 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, 6247900 + ... + 6265501.
It is an arithmetic number, because the mean of its divisors is an integer number (14847151473).
Almost surely, 2110130442201 is an apocalyptic number.
It is an amenable number.
110130442201 is a deficient number, since it is larger than the sum of its proper divisors (8646769583).
110130442201 is a wasteful number, since it uses less digits than its factorization.
110130442201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12514091.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 110130442201 its reverse (102244031011), we get a palindrome (212374473212).
The spelling of 110130442201 in words is "one hundred ten billion, one hundred thirty million, four hundred forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •