Base | Representation |
---|---|
bin | 111010110000… |
… | …0001011101101 |
3 | 2010221221022121 |
4 | 1311200023231 |
5 | 30341141134 |
6 | 3020112541 |
7 | 522550462 |
oct | 165401355 |
9 | 63857277 |
10 | 30802669 |
11 | 16429557 |
12 | a395751 |
13 | 64c6441 |
14 | 413b669 |
15 | 2a86ab4 |
hex | 1d602ed |
30802669 has 8 divisors (see below), whose sum is σ = 32101560. Its totient is φ = 29519616.
The previous prime is 30802631. The next prime is 30802697. The reversal of 30802669 is 96620803.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 16080100 + 14722569 = 4010^2 + 3837^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30802669 is a prime.
It is a super-2 number, since 2×308026692 = 1897608835047122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30802609) 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 in 7 ways as a sum of consecutive naturals, for example, 97 + ... + 7849.
It is an arithmetic number, because the mean of its divisors is an integer number (4012695).
Almost surely, 230802669 is an apocalyptic number.
It is an amenable number.
30802669 is a deficient number, since it is larger than the sum of its proper divisors (1298891).
30802669 is a wasteful number, since it uses less digits than its factorization.
30802669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7919.
The product of its (nonzero) digits is 15552, while the sum is 34.
The square root of 30802669 is about 5550.0152252043. The cubic root of 30802669 is about 313.4700955970.
The spelling of 30802669 in words is "thirty million, eight hundred two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •