Base | Representation |
---|---|
bin | 100110110111110… |
… | …0001000110110000 |
3 | 10100220021101222111 |
4 | 1031233201012300 |
5 | 10132400131000 |
6 | 333231415104 |
7 | 44215245511 |
oct | 11557410660 |
9 | 3326241874 |
10 | 1304302000 |
11 | 60a276441 |
12 | 304984494 |
13 | 17a2b3141 |
14 | c5320a08 |
15 | 7978ecba |
hex | 4dbe11b0 |
1304302000 has 80 divisors (see below), whose sum is σ = 3205803744. Its totient is φ = 513120000.
The previous prime is 1304301983. The next prime is 1304302001. The reversal of 1304302000 is 2034031.
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (1304302001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 116655 + ... + 127345.
Almost surely, 21304302000 is an apocalyptic number.
1304302000 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 1304302000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1602901872).
1304302000 is an abundant number, since it is smaller than the sum of its proper divisors (1901501744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304302000 is a wasteful number, since it uses less digits than its factorization.
1304302000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10775 (or 10759 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 1304302000 is about 36115.1214867125. The cubic root of 1304302000 is about 1092.5954478169.
Adding to 1304302000 its reverse (2034031), we get a palindrome (1306336031).
The spelling of 1304302000 in words is "one billion, three hundred four million, three hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •