Base | Representation |
---|---|
bin | 10111101110100100111110… |
… | …110000100101100101011000 |
3 | 111200111022202020102202022221 |
4 | 113232210332300211211120 |
5 | 102134231312032041120 |
6 | 1005540232032553424 |
7 | 30660314552336425 |
oct | 2756447660454530 |
9 | 450438666382287 |
10 | 104355873315160 |
11 | 30284093a30765 |
12 | b854a4a9b2874 |
13 | 462c9415811bc |
14 | 1baabcba56d4c |
15 | c0e8082400aa |
hex | 5ee93ec25958 |
104355873315160 has 32 divisors (see below), whose sum is σ = 238649907013200. Its totient is φ = 41058048516480.
The previous prime is 104355873315121. The next prime is 104355873315181. The reversal of 104355873315160 is 61513378553401.
It is a junction number, because it is equal to n+sod(n) for n = 104355873315098 and 104355873315107.
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, 21384397830 + ... + 21384402709.
Almost surely, 2104355873315160 is an apocalyptic number.
104355873315160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104355873315160 is an abundant number, since it is smaller than the sum of its proper divisors (134294033698040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104355873315160 is a wasteful number, since it uses less digits than its factorization.
104355873315160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42768800611 (or 42768800607 counting only the distinct ones).
The product of its (nonzero) digits is 4536000, while the sum is 52.
The spelling of 104355873315160 in words is "one hundred four trillion, three hundred fifty-five billion, eight hundred seventy-three million, three hundred fifteen thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •