Base | Representation |
---|---|
bin | 1000110111000010111… |
… | …01100001000101111010 |
3 | 1002002210021100201001200 |
4 | 10123201131201011322 |
5 | 14441433130301132 |
6 | 351504154155030 |
7 | 30665032020210 |
oct | 4334135410572 |
9 | 1062707321050 |
10 | 304430322042 |
11 | 108120a86880 |
12 | 4b001122a76 |
13 | 2292794a342 |
14 | 10a3d6b0cb0 |
15 | 7dbb5d6d7c |
hex | 46e176117a |
304430322042 has 48 divisors (see below), whose sum is σ = 822357237312. Its totient is φ = 79072810560.
The previous prime is 304430321969. The next prime is 304430322047. The reversal of 304430322042 is 240223034403.
304430322042 is a `hidden beast` number, since 3 + 0 + 4 + 430 + 3 + 220 + 4 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 304430321997 and 304430322015.
It is not an unprimeable number, because it can be changed into a prime (304430322047) 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 23 ways as a sum of consecutive naturals, for example, 109821963 + ... + 109824734.
It is an arithmetic number, because the mean of its divisors is an integer number (17132442444).
Almost surely, 2304430322042 is an apocalyptic number.
304430322042 is an abundant number, since it is smaller than the sum of its proper divisors (517926915270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304430322042 is a wasteful number, since it uses less digits than its factorization.
304430322042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219646723 (or 219646720 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 27.
Adding to 304430322042 its reverse (240223034403), we get a palindrome (544653356445).
The spelling of 304430322042 in words is "three hundred four billion, four hundred thirty million, three hundred twenty-two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •