Base | Representation |
---|---|
bin | 110011001110101001… |
… | …1110100101110010000 |
3 | 101111222000121212110110 |
4 | 1212131103310232100 |
5 | 3300301412331000 |
6 | 122312305001320 |
7 | 10643143326225 |
oct | 1463523645620 |
9 | 344860555413 |
10 | 110013402000 |
11 | 42724774247 |
12 | 193a3323240 |
13 | a4b3210098 |
14 | 5478cb194c |
15 | 2cdd393850 |
hex | 199d4f4b90 |
110013402000 has 80 divisors (see below), whose sum is σ = 354683227392. Its totient is φ = 29336905600.
The previous prime is 110013401963. The next prime is 110013402029. The reversal of 110013402000 is 204310011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1100134020002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9161784 + ... + 9173783.
Almost surely, 2110013402000 is an apocalyptic number.
110013402000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110013402000 is an abundant number, since it is smaller than the sum of its proper divisors (244669825392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110013402000 is a wasteful number, since it uses less digits than its factorization.
110013402000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18335593 (or 18335577 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 110013402000 its reverse (204310011), we get a palindrome (110217712011).
The spelling of 110013402000 in words is "one hundred ten billion, thirteen million, four hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •