Base | Representation |
---|---|
bin | 1100011111011… |
… | …11111010000000 |
3 | 21022011222011100 |
4 | 12033233322000 |
5 | 203311313210 |
6 | 14222014400 |
7 | 2411500050 |
oct | 617577200 |
9 | 238158140 |
10 | 104791680 |
11 | 541745a4 |
12 | 2b117400 |
13 | 18930816 |
14 | dcbb560 |
15 | 92ee5c0 |
hex | 63efe80 |
104791680 has 384 divisors, whose sum is σ = 435352320. Its totient is φ = 22708224.
The previous prime is 104791649. The next prime is 104791693. The reversal of 104791680 is 86197401.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 927304 + ... + 927416.
It is an arithmetic number, because the mean of its divisors is an integer number (1133730).
Almost surely, 2104791680 is an apocalyptic number.
104791680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104791680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217676160).
104791680 is an abundant number, since it is smaller than the sum of its proper divisors (330560640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104791680 is a wasteful number, since it uses less digits than its factorization.
104791680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168 (or 153 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The square root of 104791680 is about 10236.7807439644. The cubic root of 104791680 is about 471.4571946415.
The spelling of 104791680 in words is "one hundred four million, seven hundred ninety-one thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •