Base | Representation |
---|---|
bin | 1000110110101001111… |
… | …00011100000100011011 |
3 | 1002002020122012201001222 |
4 | 10123110330130010123 |
5 | 14441020400332443 |
6 | 351431253202255 |
7 | 30656602042322 |
oct | 4332474340433 |
9 | 1062218181058 |
10 | 304220324123 |
11 | 108023495281 |
12 | 4ab6293038b |
13 | 228c32a2411 |
14 | 10a1d8490b9 |
15 | 7da7e55468 |
hex | 46d4f1c11b |
304220324123 has 8 divisors (see below), whose sum is σ = 304538732640. Its totient is φ = 303901992640.
The previous prime is 304220324119. The next prime is 304220324153. The reversal of 304220324123 is 321423022403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 304220324123 - 22 = 304220324119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 304220324092 and 304220324101.
It is not an unprimeable number, because it can be changed into a prime (304220324153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11154938 + ... + 11182176.
It is an arithmetic number, because the mean of its divisors is an integer number (38067341580).
Almost surely, 2304220324123 is an apocalyptic number.
304220324123 is a deficient number, since it is larger than the sum of its proper divisors (318408517).
304220324123 is a wasteful number, since it uses less digits than its factorization.
304220324123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38517.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 304220324123 its reverse (321423022403), we get a palindrome (625643346526).
The spelling of 304220324123 in words is "three hundred four billion, two hundred twenty million, three hundred twenty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •