Base | Representation |
---|---|
bin | 111001100111… |
… | …1110101001111 |
3 | 2002211220021000 |
4 | 1303033311033 |
5 | 30213231112 |
6 | 2555311343 |
7 | 514535622 |
oct | 163176517 |
9 | 62756230 |
10 | 30211407 |
11 | 16065306 |
12 | a14b553 |
13 | 634a295 |
14 | 4025db9 |
15 | 29bb7dc |
hex | 1ccfd4f |
30211407 has 8 divisors (see below), whose sum is σ = 44757680. Its totient is φ = 20140920.
The previous prime is 30211403. The next prime is 30211411. The reversal of 30211407 is 70411203.
It is an interprime number because it is at equal distance from previous prime (30211403) and next prime (30211411).
It is not a de Polignac number, because 30211407 - 22 = 30211403 is a prime.
It is a super-2 number, since 2×302114072 = 1825458225839298, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30211407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30211403) 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 7 ways as a sum of consecutive naturals, for example, 559444 + ... + 559497.
It is an arithmetic number, because the mean of its divisors is an integer number (5594710).
Almost surely, 230211407 is an apocalyptic number.
30211407 is a deficient number, since it is larger than the sum of its proper divisors (14546273).
30211407 is a wasteful number, since it uses less digits than its factorization.
30211407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1118950 (or 1118944 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 30211407 is about 5496.4904257171. The cubic root of 30211407 is about 311.4514213738.
The spelling of 30211407 in words is "thirty million, two hundred eleven thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •