Base | Representation |
---|---|
bin | 111010011111… |
… | …1101110100011 |
3 | 2010201011221222 |
4 | 1310333232203 |
5 | 30322412411 |
6 | 3013205255 |
7 | 521455061 |
oct | 164775643 |
9 | 63634858 |
10 | 30669731 |
11 | 16348694 |
12 | a33082b |
13 | 647aa91 |
14 | 4105031 |
15 | 2a5c4db |
hex | 1d3fba3 |
30669731 has 4 divisors (see below), whose sum is σ = 30956472. Its totient is φ = 30382992.
The previous prime is 30669701. The next prime is 30669773. The reversal of 30669731 is 13796603.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13796603 = 19 ⋅726137.
It is a cyclic number.
It is not a de Polignac number, because 30669731 - 210 = 30668707 is a prime.
It is a super-2 number, since 2×306697312 = 1881264799224722, 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 = 30669691 and 30669700.
It is not an unprimeable number, because it can be changed into a prime (30669701) 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 in 3 ways as a sum of consecutive naturals, for example, 143210 + ... + 143423.
It is an arithmetic number, because the mean of its divisors is an integer number (7739118).
Almost surely, 230669731 is an apocalyptic number.
30669731 is a deficient number, since it is larger than the sum of its proper divisors (286741).
30669731 is a wasteful number, since it uses less digits than its factorization.
30669731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286740.
The product of its (nonzero) digits is 20412, while the sum is 35.
The square root of 30669731 is about 5538.0259118209. The cubic root of 30669731 is about 313.0184877497.
The spelling of 30669731 in words is "thirty million, six hundred sixty-nine thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •