Base | Representation |
---|---|
bin | 1000110111110001010… |
… | …01000100100110101000 |
3 | 1002010210101011010102210 |
4 | 10123320221010212220 |
5 | 14443232210231143 |
6 | 352010525525120 |
7 | 31010463452100 |
oct | 4337051044650 |
9 | 1063711133383 |
10 | 304819227048 |
11 | 108300563976 |
12 | 4b0ab4137a0 |
13 | 2298a3a584b |
14 | 10a791c8200 |
15 | 7de0808033 |
hex | 46f8a449a8 |
304819227048 has 48 divisors (see below), whose sum is σ = 886464082080. Its totient is φ = 87091207392.
The previous prime is 304819227017. The next prime is 304819227113. The reversal of 304819227048 is 840722918403.
It is a super-2 number, since 2×3048192270482 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 304819226988 and 304819227006.
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 11 ways as a sum of consecutive naturals, for example, 129598836 + ... + 129601187.
It is an arithmetic number, because the mean of its divisors is an integer number (18468001710).
Almost surely, 2304819227048 is an apocalyptic number.
It is an amenable number.
304819227048 is an abundant number, since it is smaller than the sum of its proper divisors (581644855032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304819227048 is a wasteful number, since it uses less digits than its factorization.
304819227048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259200046 (or 259200035 counting only the distinct ones).
The product of its (nonzero) digits is 774144, while the sum is 48.
It can be divided in two parts, 30481 and 9227048, that added together give a palindrome (9257529).
The spelling of 304819227048 in words is "three hundred four billion, eight hundred nineteen million, two hundred twenty-seven thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •