Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1111010010100010101 |
3 | 101112110002211221011202 |
4 | 1212220133322110111 |
5 | 3301142441320041 |
6 | 122343052242245 |
7 | 10650613031126 |
oct | 1465037722425 |
9 | 345402757152 |
10 | 110201120021 |
11 | 42810728603 |
12 | 19436170385 |
13 | a513086c35 |
14 | 5495bb804d |
15 | 2ceeac3a9b |
hex | 19a87fa515 |
110201120021 has 8 divisors (see below), whose sum is σ = 112117287744. Its totient is φ = 108295064640.
The previous prime is 110201120017. The next prime is 110201120023. The reversal of 110201120021 is 120021102011.
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 110201120021 - 22 = 110201120017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110201119984 and 110201120011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201120023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2506100 + ... + 2549693.
It is an arithmetic number, because the mean of its divisors is an integer number (14014660968).
Almost surely, 2110201120021 is an apocalyptic number.
It is an amenable number.
110201120021 is a deficient number, since it is larger than the sum of its proper divisors (1916167723).
110201120021 is an equidigital number, since it uses as much as digits as its factorization.
110201120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5056171.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110201120021 its reverse (120021102011), we get a palindrome (230222222032).
The spelling of 110201120021 in words is "one hundred ten billion, two hundred one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •