Base | Representation |
---|---|
bin | 110000110101101101… |
… | …1011000000100010000 |
3 | 101000201101010222000011 |
4 | 1201223123120010100 |
5 | 3204244134204210 |
6 | 120103143404304 |
7 | 10402030332301 |
oct | 1415333300420 |
9 | 330641128004 |
10 | 104881553680 |
11 | 405309a2692 |
12 | 183b0753694 |
13 | 9b75c69647 |
14 | 510d4cc7a8 |
15 | 2adca95d8a |
hex | 186b6d8110 |
104881553680 has 20 divisors (see below), whose sum is σ = 243849612492. Its totient is φ = 41952621440.
The previous prime is 104881553659. The next prime is 104881553681. The reversal of 104881553680 is 86355188401.
It can be written as a sum of positive squares in 2 ways, for example, as 32145621264 + 72735932416 = 179292^2 + 269696^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a super-2 number, since 2×1048815536802 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104881553681) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 655509631 + ... + 655509790.
Almost surely, 2104881553680 is an apocalyptic number.
104881553680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104881553680 is an abundant number, since it is smaller than the sum of its proper divisors (138968058812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104881553680 is a wasteful number, since it uses less digits than its factorization.
104881553680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311019434 (or 1311019428 counting only the distinct ones).
The product of its (nonzero) digits is 921600, while the sum is 49.
The spelling of 104881553680 in words is "one hundred four billion, eight hundred eighty-one million, five hundred fifty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •