Base | Representation |
---|---|
bin | 1100011001110… |
… | …11010101101110 |
3 | 21020210101121200 |
4 | 12030323111232 |
5 | 203114131303 |
6 | 14154110330 |
7 | 2402266554 |
oct | 614732556 |
9 | 236711550 |
10 | 104052078 |
11 | 53809959 |
12 | 2aa1b3a6 |
13 | 18731ca0 |
14 | db67bd4 |
15 | 92053a3 |
hex | 633b56e |
104052078 has 48 divisors (see below), whose sum is σ = 247980096. Its totient is φ = 31331520.
The previous prime is 104052077. The next prime is 104052097. The reversal of 104052078 is 870250401.
It is a super-2 number, since 2×1040520782 = 21653669872236168, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104052071) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6268 + ... + 15728.
It is an arithmetic number, because the mean of its divisors is an integer number (5166252).
Almost surely, 2104052078 is an apocalyptic number.
104052078 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 104052078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123990048).
104052078 is an abundant number, since it is smaller than the sum of its proper divisors (143928018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104052078 is a wasteful number, since it uses less digits than its factorization.
104052078 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9529 (or 9526 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 104052078 is about 10200.5920416415. The cubic root of 104052078 is about 470.3454198353.
The spelling of 104052078 in words is "one hundred four million, fifty-two thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •