Base | Representation |
---|---|
bin | 10111110010111000101010… |
… | …000001000011010110001100 |
3 | 111201112121210022120110002002 |
4 | 113302320222001003112030 |
5 | 102204104021240201020 |
6 | 1010324224205451432 |
7 | 31020564045161156 |
oct | 2762705201032614 |
9 | 451477708513062 |
10 | 104651878053260 |
11 | 3038868098a61a |
12 | b8a229a270b78 |
13 | 4651825759bc5 |
14 | 1bbb26c319ad6 |
15 | c1737ecb2975 |
hex | 5f2e2a04358c |
104651878053260 has 24 divisors (see below), whose sum is σ = 220624076000160. Its totient is φ = 41697868918784.
The previous prime is 104651878053253. The next prime is 104651878053263. The reversal of 104651878053260 is 62350878156401.
It is a junction number, because it is equal to n+sod(n) for n = 104651878053196 and 104651878053205.
It is not an unprimeable number, because it can be changed into a prime (104651878053263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10180138640 + ... + 10180148919.
It is an arithmetic number, because the mean of its divisors is an integer number (9192669833340).
Almost surely, 2104651878053260 is an apocalyptic number.
104651878053260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104651878053260 is an abundant number, since it is smaller than the sum of its proper divisors (115972197946900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104651878053260 is a wasteful number, since it uses less digits than its factorization.
104651878053260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20360287825 (or 20360287823 counting only the distinct ones).
The product of its (nonzero) digits is 9676800, while the sum is 56.
The spelling of 104651878053260 in words is "one hundred four trillion, six hundred fifty-one billion, eight hundred seventy-eight million, fifty-three thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •