Base | Representation |
---|---|
bin | 110011010100101000… |
… | …1100000001001000000 |
3 | 101112111000022101210110 |
4 | 1212221101200021000 |
5 | 3301204303320000 |
6 | 122344235031320 |
7 | 10651131364005 |
oct | 1465121401100 |
9 | 345430271713 |
10 | 110214120000 |
11 | 42817aa7696 |
12 | 1943a59b540 |
13 | a51598912a |
14 | 54977dd8ac |
15 | 2d00ce0850 |
hex | 19a9460240 |
110214120000 has 560 divisors, whose sum is σ = 379443439232. Its totient is φ = 28200960000.
The previous prime is 110214119971. The next prime is 110214120007. The reversal of 110214120000 is 21412011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (110214120007) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 457319880 + ... + 457320120.
Almost surely, 2110214120000 is an apocalyptic number.
110214120000 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 110214120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189721719616).
110214120000 is an abundant number, since it is smaller than the sum of its proper divisors (269229319232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110214120000 is a wasteful number, since it uses less digits than its factorization.
110214120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416 (or 391 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110214120000 its reverse (21412011), we get a palindrome (110235532011).
The spelling of 110214120000 in words is "one hundred ten billion, two hundred fourteen million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •