Base | Representation |
---|---|
bin | 1100011100111… |
… | …00111110111010 |
3 | 21021112201020120 |
4 | 12032130332322 |
5 | 203214431101 |
6 | 14210434110 |
7 | 2405553600 |
oct | 616347672 |
9 | 237481216 |
10 | 104452026 |
11 | 53a62398 |
12 | 2ab92936 |
13 | 18842043 |
14 | dc2d870 |
15 | 9283b36 |
hex | 639cfba |
104452026 has 48 divisors (see below), whose sum is σ = 251411040. Its totient is φ = 28812000.
The previous prime is 104452013. The next prime is 104452027. The reversal of 104452026 is 620254401.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 104451987 and 104452005.
It is not an unprimeable number, because it can be changed into a prime (104452027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2401 + ... + 14651.
It is an arithmetic number, because the mean of its divisors is an integer number (5237730).
Almost surely, 2104452026 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104452026, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125705520).
104452026 is an abundant number, since it is smaller than the sum of its proper divisors (146959014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104452026 is a wasteful number, since it uses less digits than its factorization.
104452026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12299 (or 12292 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 104452026 is about 10220.1773957207. The cubic root of 104452026 is about 470.9472761607.
The spelling of 104452026 in words is "one hundred four million, four hundred fifty-two thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •