Base | Representation |
---|---|
bin | 1000101111010111100… |
… | …01101001011101110000 |
3 | 1001201011000020120121110 |
4 | 10113223301221131300 |
5 | 14410012422412310 |
6 | 345543151153320 |
7 | 30460631213526 |
oct | 4275361513560 |
9 | 1051130216543 |
10 | 300308404080 |
11 | 1063a62a0903 |
12 | 4a250815840 |
13 | 2241b9aca29 |
14 | 1076c0a2316 |
15 | 7c297ccd20 |
hex | 45ebc69770 |
300308404080 has 160 divisors (see below), whose sum is σ = 986042942784. Its totient is φ = 75346690048.
The previous prime is 300308404049. The next prime is 300308404127. The reversal of 300308404080 is 80404803003.
It is a super-2 number, since 2×3003084040802 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14502214 + ... + 14522906.
Almost surely, 2300308404080 is an apocalyptic number.
300308404080 is a gapful number since it is divisible by the number (30) 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 300308404080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (493021471392).
300308404080 is an abundant number, since it is smaller than the sum of its proper divisors (685734538704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300308404080 is a wasteful number, since it uses less digits than its factorization.
300308404080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24283 (or 24277 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 30.
The spelling of 300308404080 in words is "three hundred billion, three hundred eight million, four hundred four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •