Base | Representation |
---|---|
bin | 11001000010100111110010… |
… | …111011100000010110010000 |
3 | 112102221110012220002211120202 |
4 | 121002213302323200112100 |
5 | 103413342432010401000 |
6 | 1030121345134554332 |
7 | 32124504035241530 |
oct | 3102476273402620 |
9 | 472843186084522 |
10 | 110131332122000 |
11 | 321004879572a2 |
12 | 104282343689a8 |
13 | 495b456149a57 |
14 | 1d2a5562cd4c0 |
15 | caeb7e4addd5 |
hex | 6429f2ee0590 |
110131332122000 has 160 divisors (see below), whose sum is σ = 307759624623360. Its totient is φ = 37335051494400.
The previous prime is 110131332121981. The next prime is 110131332122011. The reversal of 110131332122000 is 221233131011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 42947954 + ... + 45439953.
It is an arithmetic number, because the mean of its divisors is an integer number (1923497653896).
Almost surely, 2110131332122000 is an apocalyptic number.
110131332122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110131332122000 is an abundant number, since it is smaller than the sum of its proper divisors (197628292501360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110131332122000 is an equidigital number, since it uses as much as digits as its factorization.
110131332122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88388026 (or 88388010 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 110131332122000 its reverse (221233131011), we get a palindrome (110352565253011).
The spelling of 110131332122000 in words is "one hundred ten trillion, one hundred thirty-one billion, three hundred thirty-two million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •