Base | Representation |
---|---|
bin | 11001000000101111011101… |
… | …011010011110001111011000 |
3 | 112102111002201000200202111121 |
4 | 121000233131122132033120 |
5 | 103404233321230402300 |
6 | 1025542135520135024 |
7 | 32112251063332000 |
oct | 3100573532361730 |
9 | 472432630622447 |
10 | 110002122122200 |
11 | 32060702208aa0 |
12 | 10407194167474 |
13 | 494c203b36679 |
14 | 1d241b9b09000 |
15 | cab61ab9981a |
hex | 640bdd69e3d8 |
110002122122200 has 192 divisors, whose sum is σ = 325370710656000. Its totient is φ = 34286375491200.
The previous prime is 110002122122177. The next prime is 110002122122201. The reversal of 110002122122200 is 2221221200011.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002122122201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 72133104 + ... + 73642303.
It is an arithmetic number, because the mean of its divisors is an integer number (1694639118000).
Almost surely, 2110002122122200 is an apocalyptic number.
110002122122200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110002122122200 is an abundant number, since it is smaller than the sum of its proper divisors (215368588533800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002122122200 is a wasteful number, since it uses less digits than its factorization.
110002122122200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145775455 (or 145775432 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 110002122122200 its reverse (2221221200011), we get a palindrome (112223343322211).
The spelling of 110002122122200 in words is "one hundred ten trillion, two billion, one hundred twenty-two million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •