Base | Representation |
---|---|
bin | 1000111000000100001… |
… | …10110110001101010101 |
3 | 1002011012102222000111102 |
4 | 10130002012312031111 |
5 | 14444043333333344 |
6 | 352034401315445 |
7 | 31014432313532 |
oct | 4340206661525 |
9 | 1064172860442 |
10 | 304978027349 |
11 | 108382166996 |
12 | 4b134635b85 |
13 | 229b4266218 |
14 | 10a92323d89 |
15 | 7dee724e4e |
hex | 47021b6355 |
304978027349 has 2 divisors, whose sum is σ = 304978027350. Its totient is φ = 304978027348.
The previous prime is 304978027339. The next prime is 304978027351. The reversal of 304978027349 is 943720879403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 190746195025 + 114231832324 = 436745^2 + 337982^2 .
It is a cyclic number.
It is not a de Polignac number, because 304978027349 - 232 = 300683060053 is a prime.
Together with 304978027351, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 304978027294 and 304978027303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (304978027339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152489013674 + 152489013675.
It is an arithmetic number, because the mean of its divisors is an integer number (152489013675).
Almost surely, 2304978027349 is an apocalyptic number.
It is an amenable number.
304978027349 is a deficient number, since it is larger than the sum of its proper divisors (1).
304978027349 is an equidigital number, since it uses as much as digits as its factorization.
304978027349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9144576, while the sum is 56.
The spelling of 304978027349 in words is "three hundred four billion, nine hundred seventy-eight million, twenty-seven thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •