Base | Representation |
---|---|
bin | 1100011011111… |
… | …11001100010000 |
3 | 21021022111212002 |
4 | 12031333030100 |
5 | 203202030000 |
6 | 14204053132 |
7 | 2404535045 |
oct | 615771420 |
9 | 237274762 |
10 | 104330000 |
11 | 53989745 |
12 | 2ab341a8 |
13 | 187cb638 |
14 | dbdb1cc |
15 | 925c8d5 |
hex | 637f310 |
104330000 has 50 divisors (see below), whose sum is σ = 252617574. Its totient is φ = 41728000.
The previous prime is 104329993. The next prime is 104330011. The reversal of 104330000 is 33401.
It can be written as a sum of positive squares in 5 ways, for example, as 33500944 + 70829056 = 5788^2 + 8416^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 4784 + ... + 15216.
Almost surely, 2104330000 is an apocalyptic number.
104330000 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 104330000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126308787).
104330000 is an abundant number, since it is smaller than the sum of its proper divisors (148287574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104330000 is an equidigital number, since it uses as much as digits as its factorization.
104330000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10461 (or 10440 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 11.
The square root of 104330000 is about 10214.2057938931. The cubic root of 104330000 is about 470.7638100983.
Adding to 104330000 its reverse (33401), we get a palindrome (104363401).
The spelling of 104330000 in words is "one hundred four million, three hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •