Base | Representation |
---|---|
bin | 11001000001000001000100… |
… | …100101110000000111100000 |
3 | 112102112220111221211221221102 |
4 | 121001001010211300013200 |
5 | 103410041033422021230 |
6 | 1025554544222013532 |
7 | 32113520522213501 |
oct | 3101010445600740 |
9 | 472486457757842 |
10 | 110021033001440 |
11 | 32068726983510 |
12 | 1040a9914172a8 |
13 | 4950c2899c442 |
14 | 1d250914c4ba8 |
15 | cabd75ecd045 |
hex | 6410449701e0 |
110021033001440 has 48 divisors (see below), whose sum is σ = 283554207785520. Its totient is φ = 40007648363520.
The previous prime is 110021033001413. The next prime is 110021033001461. The reversal of 110021033001440 is 44100330120011.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31255973525 + ... + 31255977044.
It is an arithmetic number, because the mean of its divisors is an integer number (5907379328865).
Almost surely, 2110021033001440 is an apocalyptic number.
110021033001440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110021033001440 is an abundant number, since it is smaller than the sum of its proper divisors (173533174784080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110021033001440 is a wasteful number, since it uses less digits than its factorization.
110021033001440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62511950595 (or 62511950587 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 110021033001440 its reverse (44100330120011), we get a palindrome (154121363121451).
The spelling of 110021033001440 in words is "one hundred ten trillion, twenty-one billion, thirty-three million, one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •