Base | Representation |
---|---|
bin | 1000110110011100111… |
… | …11011011100010000100 |
3 | 1002001222002111010202020 |
4 | 10123032133123202010 |
5 | 14440310141301302 |
6 | 351412424443140 |
7 | 30654115554201 |
oct | 4331637334204 |
9 | 1061862433666 |
10 | 304112056452 |
11 | 107a78367166 |
12 | 4ab326194b0 |
13 | 228a6a256c9 |
14 | 10a0d304ca8 |
15 | 7d9d6baebc |
hex | 46ce7db884 |
304112056452 has 96 divisors (see below), whose sum is σ = 780511334400. Its totient is φ = 91731036672.
The previous prime is 304112056397. The next prime is 304112056463. The reversal of 304112056452 is 254650211403.
304112056452 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
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, 3730108 + ... + 3810764.
It is an arithmetic number, because the mean of its divisors is an integer number (8130326400).
Almost surely, 2304112056452 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 304112056452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (390255667200).
304112056452 is an abundant number, since it is smaller than the sum of its proper divisors (476399277948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304112056452 is a wasteful number, since it uses less digits than its factorization.
304112056452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81425 (or 81423 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 304112056452 its reverse (254650211403), we get a palindrome (558762267855).
The spelling of 304112056452 in words is "three hundred four billion, one hundred twelve million, fifty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •