Base | Representation |
---|---|
bin | 110000101000101000… |
… | …0111000100010011000 |
3 | 100222120210011120120001 |
4 | 1201101100320202120 |
5 | 3202344301023410 |
6 | 115551423142344 |
7 | 10355120261626 |
oct | 1412120704230 |
9 | 328523146501 |
10 | 104442595480 |
11 | 40326138913 |
12 | 182a97449b4 |
13 | 9b06037772 |
14 | 50ab0a6516 |
15 | 2ab428933a |
hex | 1851438898 |
104442595480 has 64 divisors (see below), whose sum is σ = 235824566400. Its totient is φ = 41629969920.
The previous prime is 104442595469. The next prime is 104442595489. The reversal of 104442595480 is 84595244401.
It is a self number, because there is not a number n which added to its sum of digits gives 104442595480.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104442595489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15201486 + ... + 15208354.
It is an arithmetic number, because the mean of its divisors is an integer number (3684758850).
Almost surely, 2104442595480 is an apocalyptic number.
104442595480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104442595480 is an abundant number, since it is smaller than the sum of its proper divisors (131381970920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104442595480 is a wasteful number, since it uses less digits than its factorization.
104442595480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8164 (or 8160 counting only the distinct ones).
The product of its (nonzero) digits is 921600, while the sum is 46.
The spelling of 104442595480 in words is "one hundred four billion, four hundred forty-two million, five hundred ninety-five thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •