Base | Representation |
---|---|
bin | 1000110111101000100… |
… | …11101000110000000000 |
3 | 1002010121022022011102001 |
4 | 10123310103220300000 |
5 | 14443110100432242 |
6 | 351555411033344 |
7 | 31005621334141 |
oct | 4336423506000 |
9 | 1063538264361 |
10 | 304746499072 |
11 | 1082734aa304 |
12 | 4b08ab9b854 |
13 | 229782c0442 |
14 | 10a6d695ac8 |
15 | 7dd923deb7 |
hex | 46f44e8c00 |
304746499072 has 88 divisors (see below), whose sum is σ = 630610446960. Its totient is φ = 147023708160.
The previous prime is 304746499039. The next prime is 304746499087. The reversal of 304746499072 is 270994647403.
It is a super-2 number, since 2×3047464990722 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72367047 + ... + 72371257.
Almost surely, 2304746499072 is an apocalyptic number.
304746499072 is a gapful number since it is divisible by the number (32) 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 304746499072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (315305223480).
304746499072 is an abundant number, since it is smaller than the sum of its proper divisors (325863947888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304746499072 is a wasteful number, since it uses less digits than its factorization.
304746499072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6697 (or 6679 counting only the distinct ones).
The product of its (nonzero) digits is 9144576, while the sum is 55.
The spelling of 304746499072 in words is "three hundred four billion, seven hundred forty-six million, four hundred ninety-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •