Base | Representation |
---|---|
bin | 10111101100111101000110… |
… | …010100110110111000100100 |
3 | 111200002122211200002211201010 |
4 | 113230331012110312320210 |
5 | 102130414342231122040 |
6 | 1005413103512302220 |
7 | 30646255463304636 |
oct | 2754750624667044 |
9 | 450078750084633 |
10 | 104244331114020 |
11 | 302408552a7059 |
12 | b8372bb6a1970 |
13 | 4622276707656 |
14 | 1ba5649b06a56 |
15 | c0b97aa63e80 |
hex | 5ecf46536e24 |
104244331114020 has 48 divisors (see below), whose sum is σ = 301949097024960. Its totient is φ = 26839919734656.
The previous prime is 104244331114013. The next prime is 104244331114031. The reversal of 104244331114020 is 20411133442401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 29955265822 + ... + 29955269301.
It is an arithmetic number, because the mean of its divisors is an integer number (6290606188020).
Almost surely, 2104244331114020 is an apocalyptic number.
104244331114020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104244331114020 is an abundant number, since it is smaller than the sum of its proper divisors (197704765910940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104244331114020 is a wasteful number, since it uses less digits than its factorization.
104244331114020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59910535164 (or 59910535162 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 104244331114020 its reverse (20411133442401), we get a palindrome (124655464556421).
The spelling of 104244331114020 in words is "one hundred four trillion, two hundred forty-four billion, three hundred thirty-one million, one hundred fourteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •