Base | Representation |
---|---|
bin | 10010001101000… |
… | …011110011001001 |
3 | 210021200121022111 |
4 | 102031003303021 |
5 | 1111141211241 |
6 | 50150022321 |
7 | 10365653563 |
oct | 2215036311 |
9 | 707617274 |
10 | 305413321 |
11 | 147441604 |
12 | 863479a1 |
13 | 4b374a55 |
14 | 2c7c2333 |
15 | 1bc2cc81 |
hex | 12343cc9 |
305413321 has 2 divisors, whose sum is σ = 305413322. Its totient is φ = 305413320.
The previous prime is 305413319. The next prime is 305413337. The reversal of 305413321 is 123314503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 162945225 + 142468096 = 12765^2 + 11936^2 .
It is a cyclic number.
It is not a de Polignac number, because 305413321 - 21 = 305413319 is a prime.
Together with 305413319, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 305413292 and 305413301.
It is not a weakly prime, because it can be changed into another prime (305411321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152706660 + 152706661.
It is an arithmetic number, because the mean of its divisors is an integer number (152706661).
Almost surely, 2305413321 is an apocalyptic number.
It is an amenable number.
305413321 is a deficient number, since it is larger than the sum of its proper divisors (1).
305413321 is an equidigital number, since it uses as much as digits as its factorization.
305413321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 305413321 is about 17476.0785361019. The cubic root of 305413321 is about 673.4354774024.
Adding to 305413321 its reverse (123314503), we get a palindrome (428727824).
The spelling of 305413321 in words is "three hundred five million, four hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •