Base | Representation |
---|---|
bin | 11001000001000000000111… |
… | …000001111101110100101101 |
3 | 112102112210211222110201201210 |
4 | 121001000013001331310231 |
5 | 103410031430023211341 |
6 | 1025554253525425033 |
7 | 32113453111510413 |
oct | 3101000701756455 |
9 | 472483758421653 |
10 | 110020000210221 |
11 | 320682469a3152 |
12 | 1040a74356b179 |
13 | 4950ac2a2098a |
14 | 1d24dd427d2b3 |
15 | cabd154c0c16 |
hex | 64100707dd2d |
110020000210221 has 8 divisors (see below), whose sum is σ = 146693470878784. Its totient is φ = 73346598174240.
The previous prime is 110020000210217. The next prime is 110020000210247. The reversal of 110020000210221 is 122012000020011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110020000210221 - 22 = 110020000210217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110020000210197 and 110020000210206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020000210201) 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, 13293385 + ... + 19918686.
It is an arithmetic number, because the mean of its divisors is an integer number (18336683859848).
Almost surely, 2110020000210221 is an apocalyptic number.
It is an amenable number.
110020000210221 is a deficient number, since it is larger than the sum of its proper divisors (36673470668563).
110020000210221 is a wasteful number, since it uses less digits than its factorization.
110020000210221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34316291.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110020000210221 its reverse (122012000020011), we get a palindrome (232032000230232).
The spelling of 110020000210221 in words is "one hundred ten trillion, twenty billion, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •