Base | Representation |
---|---|
bin | 100010100011111110010011… |
… | …0110111100100000001000110 |
3 | 1110212102012100202101021101002 |
4 | 1011013330212313210001012 |
5 | 304321410141441244142 |
6 | 2554324512352333302 |
7 | 121015043653630646 |
oct | 10507744667440106 |
9 | 1425365322337332 |
10 | 304011322212422 |
11 | 8895a528914940 |
12 | 2a11b520844232 |
13 | 100831b5b02116 |
14 | 551032575c526 |
15 | 2523073803a32 |
hex | 1147f26de4046 |
304011322212422 has 48 divisors (see below), whose sum is σ = 514398023053200. Its totient is φ = 133635724891200.
The previous prime is 304011322212421. The next prime is 304011322212469. The reversal of 304011322212422 is 224212223110403.
It is a super-2 number, since 2×3040113222124222 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304011322212421) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 25180604 + ... + 35243232.
It is an arithmetic number, because the mean of its divisors is an integer number (10716625480275).
Almost surely, 2304011322212422 is an apocalyptic number.
304011322212422 is a deficient number, since it is larger than the sum of its proper divisors (210386700840778).
304011322212422 is a wasteful number, since it uses less digits than its factorization.
304011322212422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10064133 (or 10064102 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 304011322212422 its reverse (224212223110403), we get a palindrome (528223545322825).
The spelling of 304011322212422 in words is "three hundred four trillion, eleven billion, three hundred twenty-two million, two hundred twelve thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •