Base | Representation |
---|---|
bin | 10010001100111… |
… | …111010101010111 |
3 | 210021122200020002 |
4 | 102030333111113 |
5 | 1111140120111 |
6 | 50145401515 |
7 | 10365546344 |
oct | 2214772527 |
9 | 707580202 |
10 | 305395031 |
11 | 147429897 |
12 | 8633929b |
13 | 4b369626 |
14 | 2c7b97cb |
15 | 1bc2763b |
hex | 1233f557 |
305395031 has 2 divisors, whose sum is σ = 305395032. Its totient is φ = 305395030.
The previous prime is 305395009. The next prime is 305395061. The reversal of 305395031 is 130593503.
It is a weak prime.
It is an emirp because it is prime and its reverse (130593503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 305395031 - 26 = 305394967 is a prime.
It is a super-3 number, since 3×3053950313 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 305394985 and 305395003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (305395061) 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, 152697515 + 152697516.
It is an arithmetic number, because the mean of its divisors is an integer number (152697516).
Almost surely, 2305395031 is an apocalyptic number.
305395031 is a deficient number, since it is larger than the sum of its proper divisors (1).
305395031 is an equidigital number, since it uses as much as digits as its factorization.
305395031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6075, while the sum is 29.
The square root of 305395031 is about 17475.5552415367. Note that the first 3 decimals coincide. The cubic root of 305395031 is about 673.4220340019.
The spelling of 305395031 in words is "three hundred five million, three hundred ninety-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •