Base | Representation |
---|---|
bin | 111010010111… |
… | …0101110100111 |
3 | 2010120122110011 |
4 | 1310232232213 |
5 | 30313200403 |
6 | 3011511051 |
7 | 521045062 |
oct | 164565647 |
9 | 63518404 |
10 | 30600103 |
11 | 16300346 |
12 | a2b8487 |
13 | 6455191 |
14 | 40c78d9 |
15 | 2a46a6d |
hex | 1d2eba7 |
30600103 has 4 divisors (see below), whose sum is σ = 30615328. Its totient is φ = 30584880.
The previous prime is 30600091. The next prime is 30600107. The reversal of 30600103 is 30100603.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30600103 is a prime.
It is a super-2 number, since 2×306001032 = 1872732607221218, 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 (30600107) 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, 4038 + ... + 8803.
It is an arithmetic number, because the mean of its divisors is an integer number (7653832).
Almost surely, 230600103 is an apocalyptic number.
30600103 is a deficient number, since it is larger than the sum of its proper divisors (15225).
30600103 is a wasteful number, since it uses less digits than its factorization.
30600103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15224.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 30600103 is about 5531.7359843000. The cubic root of 30600103 is about 312.7814313790.
Adding to 30600103 its reverse (30100603), we get a palindrome (60700706).
Subtracting from 30600103 its reverse (30100603), we obtain a triangular number (499500 = T999).
It can be divided in two parts, 30600 and 103, that added together give a palindrome (30703).
The spelling of 30600103 in words is "thirty million, six hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •