Base | Representation |
---|---|
bin | 1000110110011101111… |
… | …10001010011111111000 |
3 | 1002001222122122110110020 |
4 | 10123032332022133320 |
5 | 14440314222110034 |
6 | 351413313250440 |
7 | 30654244211121 |
oct | 4331676123770 |
9 | 1061878573406 |
10 | 304120113144 |
11 | 107a8196a291 |
12 | 4ab35263a20 |
13 | 228a85b6893 |
14 | 10a10401048 |
15 | 7d9e25d249 |
hex | 46cef8a7f8 |
304120113144 has 16 divisors (see below), whose sum is σ = 760300282920. Its totient is φ = 101373371040.
The previous prime is 304120113139. The next prime is 304120113181. The reversal of 304120113144 is 441311021403.
It is a super-3 number, since 3×3041201131443 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 12671671381 = 304120113144 / (3 + 0 + 4 + 1 + 2 + 0 + 1 + 1 + 3 + 1 + 4 + 4).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6335835667 + ... + 6335835714.
Almost surely, 2304120113144 is an apocalyptic number.
It is an amenable number.
304120113144 is an abundant number, since it is smaller than the sum of its proper divisors (456180169776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304120113144 is a wasteful number, since it uses less digits than its factorization.
304120113144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12671671390 (or 12671671386 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 304120113144 its reverse (441311021403), we get a palindrome (745431134547).
The spelling of 304120113144 in words is "three hundred four billion, one hundred twenty million, one hundred thirteen thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •