Base | Representation |
---|---|
bin | 110011010100100001… |
… | …0100011000111010101 |
3 | 101112110201221020121001 |
4 | 1212221002203013111 |
5 | 3301202302400041 |
6 | 122344015023301 |
7 | 10651053146335 |
oct | 1465102430725 |
9 | 345421836531 |
10 | 110210200021 |
11 | 4281586a539 |
12 | 1943920ab31 |
13 | a514c15b0c |
14 | 549709d0c5 |
15 | 2d007b9131 |
hex | 19a90a31d5 |
110210200021 has 16 divisors (see below), whose sum is σ = 115576876800. Its totient is φ = 104892023808.
The previous prime is 110210199989. The next prime is 110210200039. The reversal of 110210200021 is 120002012011.
It is a cyclic number.
It is not a de Polignac number, because 110210200021 - 25 = 110210199989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110210199980 and 110210200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110210200421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9722485 + ... + 9733813.
It is an arithmetic number, because the mean of its divisors is an integer number (7223554800).
Almost surely, 2110210200021 is an apocalyptic number.
It is an amenable number.
110210200021 is a deficient number, since it is larger than the sum of its proper divisors (5366676779).
110210200021 is a wasteful number, since it uses less digits than its factorization.
110210200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13428.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110210200021 its reverse (120002012011), we get a palindrome (230212212032).
The spelling of 110210200021 in words is "one hundred ten billion, two hundred ten million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •