Base | Representation |
---|---|
bin | 11001000000101111100011… |
… | …010011101111101110101000 |
3 | 112102111002221220210101200121 |
4 | 121000233203103233232220 |
5 | 103404234022040201440 |
6 | 1025542153412013024 |
7 | 32112253404062650 |
oct | 3100574323575650 |
9 | 472432856711617 |
10 | 110002221022120 |
11 | 32060753018a69 |
12 | 10407201301174 |
13 | 494c21b48352b |
14 | 1d241c8cd1360 |
15 | cab6246d334a |
hex | 640be34efba8 |
110002221022120 has 128 divisors (see below), whose sum is σ = 288099135129600. Its totient is φ = 37020854635776.
The previous prime is 110002221022097. The next prime is 110002221022139. The reversal of 110002221022120 is 21220122200011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110002221022094 and 110002221022103.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5050740 + ... + 15668899.
It is an arithmetic number, because the mean of its divisors is an integer number (2250774493200).
Almost surely, 2110002221022120 is an apocalyptic number.
110002221022120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110002221022120 is an abundant number, since it is smaller than the sum of its proper divisors (178096914107480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002221022120 is a wasteful number, since it uses less digits than its factorization.
110002221022120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20720007 (or 20720003 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 110002221022120 its reverse (21220122200011), we get a palindrome (131222343222131).
The spelling of 110002221022120 in words is "one hundred ten trillion, two billion, two hundred twenty-one million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •