Base | Representation |
---|---|
bin | 110011001111011101… |
… | …1010010010100000010 |
3 | 101112000220122210220020 |
4 | 1212132323102110002 |
5 | 3300330333232114 |
6 | 122315114154310 |
7 | 10643623010220 |
oct | 1463673222402 |
9 | 345026583806 |
10 | 110040524034 |
11 | 42739009451 |
12 | 193b0422996 |
13 | a4b8a1811c |
14 | 547c731b10 |
15 | 2ce094eaa9 |
hex | 199eed2502 |
110040524034 has 64 divisors (see below), whose sum is σ = 266681154816. Its totient is φ = 29550219264.
The previous prime is 110040524021. The next prime is 110040524063. The reversal of 110040524034 is 430425040011.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110040523995 and 110040524013.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 418234 + ... + 628490.
It is an arithmetic number, because the mean of its divisors is an integer number (4166893044).
Almost surely, 2110040524034 is an apocalyptic number.
110040524034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 110040524034, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133340577408).
110040524034 is an abundant number, since it is smaller than the sum of its proper divisors (156640630782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110040524034 is a wasteful number, since it uses less digits than its factorization.
110040524034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211019.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 110040524034 its reverse (430425040011), we get a palindrome (540465564045).
The spelling of 110040524034 in words is "one hundred ten billion, forty million, five hundred twenty-four thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •