Base | Representation |
---|---|
bin | 111001011010… |
… | …1000111110111 |
3 | 2002122100012011 |
4 | 1302311013313 |
5 | 30201231012 |
6 | 2553105051 |
7 | 513601645 |
oct | 162650767 |
9 | 62570164 |
10 | 30102007 |
11 | 15aa00a1 |
12 | a0b8187 |
13 | 630c550 |
14 | 3dd8195 |
15 | 29991a7 |
hex | 1cb51f7 |
30102007 has 4 divisors (see below), whose sum is σ = 32417560. Its totient is φ = 27786456.
The previous prime is 30101999. The next prime is 30102031. The reversal of 30102007 is 70020103.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70020103 = 31 ⋅2258713.
It is a cyclic number.
It is not a de Polignac number, because 30102007 - 23 = 30101999 is a prime.
It is a super-2 number, since 2×301020072 = 1812261650856098, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 2315539 = 30102007 / (3 + 0 + 1 + 0 + 2 + 0 + 0 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30102047) 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, 1157757 + ... + 1157782.
It is an arithmetic number, because the mean of its divisors is an integer number (8104390).
Almost surely, 230102007 is an apocalyptic number.
30102007 is a deficient number, since it is larger than the sum of its proper divisors (2315553).
30102007 is a wasteful number, since it uses less digits than its factorization.
30102007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2315552.
The product of its (nonzero) digits is 42, while the sum is 13.
The square root of 30102007 is about 5486.5295952906. The cubic root of 30102007 is about 311.0750293709.
The spelling of 30102007 in words is "thirty million, one hundred two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •