Base | Representation |
---|---|
bin | 1000110110101001110… |
… | …11101111001000000001 |
3 | 1002002020121212100112211 |
4 | 10123110323233020001 |
5 | 14441020323440113 |
6 | 351431245222121 |
7 | 30656600344525 |
oct | 4332473571001 |
9 | 1062217770484 |
10 | 304220140033 |
11 | 108023379a37 |
12 | 4ab62861941 |
13 | 228c32396a4 |
14 | 10a1d7dbd85 |
15 | 7da7e1ab3d |
hex | 46d4eef201 |
304220140033 has 2 divisors, whose sum is σ = 304220140034. Its totient is φ = 304220140032.
The previous prime is 304220140027. The next prime is 304220140051. The reversal of 304220140033 is 330041022403.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 264336854769 + 39883285264 = 514137^2 + 199708^2 .
It is a cyclic number.
It is not a de Polignac number, because 304220140033 - 225 = 304186585601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 304220139986 and 304220140013.
It is not a weakly prime, because it can be changed into another prime (304220140013) 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 as a sum of consecutive naturals, namely, 152110070016 + 152110070017.
It is an arithmetic number, because the mean of its divisors is an integer number (152110070017).
Almost surely, 2304220140033 is an apocalyptic number.
It is an amenable number.
304220140033 is a deficient number, since it is larger than the sum of its proper divisors (1).
304220140033 is an equidigital number, since it uses as much as digits as its factorization.
304220140033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 304220140033 its reverse (330041022403), we get a palindrome (634261162436).
The spelling of 304220140033 in words is "three hundred four billion, two hundred twenty million, one hundred forty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •