Base | Representation |
---|---|
bin | 11001000000110110111111… |
… | …100111010111010111010101 |
3 | 112102111212120211110020012112 |
4 | 121000312333213113113111 |
5 | 103404401403300320041 |
6 | 1025545554353000405 |
7 | 32112655416225323 |
oct | 3100667747272725 |
9 | 472455524406175 |
10 | 110010212120021 |
11 | 32064083866104 |
12 | 10408871553105 |
13 | 494cbc2bca725 |
14 | 1d2474631cd13 |
15 | cab941020deb |
hex | 640dbf9d75d5 |
110010212120021 has 16 divisors (see below), whose sum is σ = 112800909312960. Its totient is φ = 107230160378880.
The previous prime is 110010212119999. The next prime is 110010212120023. The reversal of 110010212120021 is 120021212010011.
It is a cyclic number.
It is not a de Polignac number, because 110010212120021 - 226 = 110010145011157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110010212119978 and 110010212120005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110010212120023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108202010 + ... + 109213988.
It is an arithmetic number, because the mean of its divisors is an integer number (7050056832060).
Almost surely, 2110010212120021 is an apocalyptic number.
It is an amenable number.
110010212120021 is a deficient number, since it is larger than the sum of its proper divisors (2790697192939).
110010212120021 is a wasteful number, since it uses less digits than its factorization.
110010212120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1017236.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110010212120021 its reverse (120021212010011), we get a palindrome (230031424130032).
The spelling of 110010212120021 in words is "one hundred ten trillion, ten billion, two hundred twelve million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •