Base | Representation |
---|---|
bin | 110011010101001111… |
… | …0110111010100000000 |
3 | 101112112102110201201120 |
4 | 1212222132313110000 |
5 | 3301230001300000 |
6 | 122350241432240 |
7 | 10651465640244 |
oct | 1465236672400 |
9 | 345472421646 |
10 | 110234400000 |
11 | 4282849931a |
12 | 1944533b680 |
13 | a519c39b2a |
14 | 549a39c424 |
15 | 2d029996a0 |
hex | 19aa7b7500 |
110234400000 has 432 divisors, whose sum is σ = 382842246528. Its totient is φ = 28103680000.
The previous prime is 110234399969. The next prime is 110234400097. The reversal of 110234400000 is 4432011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 55199002 + ... + 55200998.
It is an arithmetic number, because the mean of its divisors is an integer number (886208904).
Almost surely, 2110234400000 is an apocalyptic number.
110234400000 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 110234400000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191421123264).
110234400000 is an abundant number, since it is smaller than the sum of its proper divisors (272607846528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110234400000 is an frugal number, since it uses more digits than its factorization.
110234400000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2064 (or 2030 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 110234400000 its reverse (4432011), we get a palindrome (110238832011).
The spelling of 110234400000 in words is "one hundred ten billion, two hundred thirty-four million, four hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •