Base | Representation |
---|---|
bin | 1100011001100… |
… | …01100011100000 |
3 | 21020201100122022 |
4 | 12030301203200 |
5 | 203111341000 |
6 | 14153201012 |
7 | 2402041661 |
oct | 614614340 |
9 | 236640568 |
10 | 104012000 |
11 | 53791834 |
12 | 2aa00168 |
13 | 18719981 |
14 | db57368 |
15 | 91e8585 |
hex | 63318e0 |
104012000 has 48 divisors (see below), whose sum is σ = 255567312. Its totient is φ = 41603200.
The previous prime is 104011991. The next prime is 104012011. The reversal of 104012000 is 210401.
It is a super-2 number, since 2×1040120002 = 21636992288000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9002 + ... + 17001.
It is an arithmetic number, because the mean of its divisors is an integer number (5324319).
Almost surely, 2104012000 is an apocalyptic number.
104012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104012000 is an abundant number, since it is smaller than the sum of its proper divisors (151555312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104012000 is an equidigital number, since it uses as much as digits as its factorization.
104012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26028 (or 26010 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 104012000 is about 10198.6273586204. The cubic root of 104012000 is about 470.2850240384.
Adding to 104012000 its reverse (210401), we get a palindrome (104222401).
The spelling of 104012000 in words is "one hundred four million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.412 sec. • engine limits •