Base | Representation |
---|---|
bin | 110011011011011101… |
… | …1100010001000010000 |
3 | 101120001222110000002110 |
4 | 1212312323202020100 |
5 | 3302141432221000 |
6 | 122423101545320 |
7 | 10656613032120 |
oct | 1466673421020 |
9 | 346058400073 |
10 | 110443242000 |
11 | 42925370413 |
12 | 194a3275240 |
13 | a55129b890 |
14 | 54ba002c80 |
15 | 2d15e9d850 |
hex | 19b6ee2210 |
110443242000 has 320 divisors, whose sum is σ = 438240950784. Its totient is φ = 23302195200.
The previous prime is 110443241989. The next prime is 110443242023. The reversal of 110443242000 is 242344011.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 444862 + ... + 647138.
Almost surely, 2110443242000 is an apocalyptic number.
110443242000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110443242000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219120475392).
110443242000 is an abundant number, since it is smaller than the sum of its proper divisors (327797708784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110443242000 is a wasteful number, since it uses less digits than its factorization.
110443242000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202323 (or 202307 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 110443242000 its reverse (242344011), we get a palindrome (110685586011).
The spelling of 110443242000 in words is "one hundred ten billion, four hundred forty-three million, two hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •