Base | Representation |
---|---|
bin | 111001110010… |
… | …1011101111111 |
3 | 2010000101211101 |
4 | 1303211131333 |
5 | 30224100111 |
6 | 3001233531 |
7 | 515355166 |
oct | 163453577 |
9 | 63011741 |
10 | 30300031 |
11 | 16115953 |
12 | a1928a7 |
13 | 637b718 |
14 | 404a3dd |
15 | 29d7bc1 |
hex | 1ce577f |
30300031 has 4 divisors (see below), whose sum is σ = 30726864. Its totient is φ = 29873200.
The previous prime is 30299999. The next prime is 30300073. The reversal of 30300031 is 13000303.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30300031 - 25 = 30299999 is a prime.
It is a super-2 number, since 2×303000312 = 1836183757201922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30299990 and 30300017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30300091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213310 + ... + 213451.
It is an arithmetic number, because the mean of its divisors is an integer number (7681716).
Almost surely, 230300031 is an apocalyptic number.
30300031 is a deficient number, since it is larger than the sum of its proper divisors (426833).
30300031 is an equidigital number, since it uses as much as digits as its factorization.
30300031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 426832.
The product of its (nonzero) digits is 27, while the sum is 10.
The square root of 30300031 is about 5504.5463936641. The cubic root of 30300031 is about 311.7556676562.
Adding to 30300031 its reverse (13000303), we get a palindrome (43300334).
It can be divided in two parts, 303000 and 31, that added together give a triangular number (303031 = T778).
The spelling of 30300031 in words is "thirty million, three hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •