Base | Representation |
---|---|
bin | 110011010100100001… |
… | …0100011100110100101 |
3 | 101112110201221100100010 |
4 | 1212221002203212211 |
5 | 3301202302431041 |
6 | 122344015040433 |
7 | 10651053155223 |
oct | 1465102434645 |
9 | 345421840303 |
10 | 110210202021 |
11 | 42815870a97 |
12 | 19439210119 |
13 | a514c169ba |
14 | 549709db13 |
15 | 2d007b9a16 |
hex | 19a90a39a5 |
110210202021 has 8 divisors (see below), whose sum is σ = 146963506624. Its totient is φ = 73465182720.
The previous prime is 110210202001. The next prime is 110210202029. The reversal of 110210202021 is 120202012011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110210202021 - 29 = 110210201509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110210201988 and 110210202006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110210202029) 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 7 ways as a sum of consecutive naturals, for example, 2040220 + ... + 2093541.
It is an arithmetic number, because the mean of its divisors is an integer number (18370438328).
Almost surely, 2110210202021 is an apocalyptic number.
It is an amenable number.
110210202021 is a deficient number, since it is larger than the sum of its proper divisors (36753304603).
110210202021 is an equidigital number, since it uses as much as digits as its factorization.
110210202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4142651.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110210202021 its reverse (120202012011), we get a palindrome (230412214032).
The spelling of 110210202021 in words is "one hundred ten billion, two hundred ten million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •