Base | Representation |
---|---|
bin | 110011010010011110… |
… | …0001001001010100000 |
3 | 101112021221111110011120 |
4 | 1212210330021022200 |
5 | 3301032200141000 |
6 | 122333120412240 |
7 | 10646256361224 |
oct | 1464474111240 |
9 | 345257443146 |
10 | 110141412000 |
11 | 4278aa57034 |
12 | 1941a177080 |
13 | a5038acb49 |
14 | 548bcb4784 |
15 | 2ce972c6a0 |
hex | 19a4f092a0 |
110141412000 has 96 divisors (see below), whose sum is σ = 360823305024. Its totient is φ = 29371040000.
The previous prime is 110141411983. The next prime is 110141412019. The reversal of 110141412000 is 214141011.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×1101414120002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4577226 + ... + 4601225.
It is an arithmetic number, because the mean of its divisors is an integer number (3758576094).
Almost surely, 2110141412000 is an apocalyptic number.
110141412000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110141412000 is an abundant number, since it is smaller than the sum of its proper divisors (250681893024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110141412000 is an equidigital number, since it uses as much as digits as its factorization.
110141412000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9178479 (or 9178461 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110141412000 its reverse (214141011), we get a palindrome (110355553011).
The spelling of 110141412000 in words is "one hundred ten billion, one hundred forty-one million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •