Base | Representation |
---|---|
bin | 11001000110110101001001… |
… | …000010010001011000100000 |
3 | 112110222002201020220011010020 |
4 | 121012311021002101120200 |
5 | 103433112231110420440 |
6 | 1030502255013433440 |
7 | 32154422622623400 |
oct | 3106651102213040 |
9 | 473862636804106 |
10 | 110420539545120 |
11 | 322020a6a08872 |
12 | 104742a733b880 |
13 | 497c7c6006c9c |
14 | 1d3a54dd16800 |
15 | cb74594023d0 |
hex | 646d49091620 |
110420539545120 has 288 divisors, whose sum is σ = 425907797112000. Its totient is φ = 23910612977664.
The previous prime is 110420539545091. The next prime is 110420539545131. The reversal of 110420539545120 is 21545935024011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
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 47 ways as a sum of consecutive naturals, for example, 123099195 + ... + 123992954.
It is an arithmetic number, because the mean of its divisors is an integer number (1478846517750).
Almost surely, 2110420539545120 is an apocalyptic number.
110420539545120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110420539545120 is an abundant number, since it is smaller than the sum of its proper divisors (315487257566880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110420539545120 is a wasteful number, since it uses less digits than its factorization.
110420539545120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247092200 (or 247092185 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 42.
The spelling of 110420539545120 in words is "one hundred ten trillion, four hundred twenty billion, five hundred thirty-nine million, five hundred forty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •