Base | Representation |
---|---|
bin | 111001110100… |
… | …0011001001101 |
3 | 2010001000021011 |
4 | 1303220121031 |
5 | 30224441023 |
6 | 3001405221 |
7 | 515435134 |
oct | 163503115 |
9 | 63030234 |
10 | 30312013 |
11 | 16123956 |
12 | a199811 |
13 | 6384004 |
14 | 405091b |
15 | 29db50d |
hex | 1ce864d |
30312013 has 2 divisors, whose sum is σ = 30312014. Its totient is φ = 30312012.
The previous prime is 30311977. The next prime is 30312053. The reversal of 30312013 is 31021303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23011209 + 7300804 = 4797^2 + 2702^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30312013 is a prime.
It is a super-2 number, since 2×303120132 = 1837636264224338, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30311984 and 30312002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30312053) 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, 15156006 + 15156007.
It is an arithmetic number, because the mean of its divisors is an integer number (15156007).
Almost surely, 230312013 is an apocalyptic number.
It is an amenable number.
30312013 is a deficient number, since it is larger than the sum of its proper divisors (1).
30312013 is an equidigital number, since it uses as much as digits as its factorization.
30312013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 30312013 is about 5505.6346591469. The cubic root of 30312013 is about 311.7967563285.
Adding to 30312013 its reverse (31021303), we get a palindrome (61333316).
The spelling of 30312013 in words is "thirty million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •