Base | Representation |
---|---|
bin | 110000100100011101… |
… | …0001111101100100100 |
3 | 100222020000110002220120 |
4 | 1201020322033230210 |
5 | 3202102411141200 |
6 | 115525455201540 |
7 | 10351466065656 |
oct | 1411072175444 |
9 | 328200402816 |
10 | 104302443300 |
11 | 40264012470 |
12 | 1826a8162b0 |
13 | 9ab2ca6093 |
14 | 50966226d6 |
15 | 2aa6d029a0 |
hex | 1848e8fb24 |
104302443300 has 144 divisors (see below), whose sum is σ = 329347587072. Its totient is φ = 25275369600.
The previous prime is 104302443253. The next prime is 104302443313. The reversal of 104302443300 is 3344203401.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 11423337 + ... + 11432463.
Almost surely, 2104302443300 is an apocalyptic number.
104302443300 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 104302443300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164673793536).
104302443300 is an abundant number, since it is smaller than the sum of its proper divisors (225045143772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104302443300 is a wasteful number, since it uses less digits than its factorization.
104302443300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12618 (or 12611 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 104302443300 its reverse (3344203401), we get a palindrome (107646646701).
The spelling of 104302443300 in words is "one hundred four billion, three hundred two million, four hundred forty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •