Base | Representation |
---|---|
bin | 1100011111110… |
… | …01111011010000 |
3 | 21022021001110100 |
4 | 12033321323100 |
5 | 203314121340 |
6 | 14222532400 |
7 | 2412030516 |
oct | 617717320 |
9 | 238231410 |
10 | 104832720 |
11 | 541a2413 |
12 | 2b137100 |
13 | 189463c5 |
14 | dccc4b6 |
15 | 930b830 |
hex | 63f9ed0 |
104832720 has 60 divisors (see below), whose sum is σ = 352065636. Its totient is φ = 27955200.
The previous prime is 104832719. The next prime is 104832733. The reversal of 104832720 is 27238401.
It can be written as a sum of positive squares in 2 ways, for example, as 67963536 + 36869184 = 8244^2 + 6072^2 .
It is a tau number, because it is divible by the number of its divisors (60).
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72081 + ... + 73520.
Almost surely, 2104832720 is an apocalyptic number.
104832720 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104832720 is an abundant number, since it is smaller than the sum of its proper divisors (247232916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104832720 is a wasteful number, since it uses less digits than its factorization.
104832720 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145620 (or 145611 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 104832720 is about 10238.7850841787. The cubic root of 104832720 is about 471.5187328538.
It can be divided in two parts, 10483 and 2720, that added together give a triangular number (13203 = T162).
The spelling of 104832720 in words is "one hundred four million, eight hundred thirty-two thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •