Base | Representation |
---|---|
bin | 111010011101… |
… | …1000010100011 |
3 | 2010200012121212 |
4 | 1310323002203 |
5 | 30321304111 |
6 | 3012540335 |
7 | 521345102 |
oct | 164730243 |
9 | 63605555 |
10 | 30650531 |
11 | 1633521a |
12 | a3216ab |
13 | 6472112 |
14 | 40dc039 |
15 | 2a5698b |
hex | 1d3b0a3 |
30650531 has 4 divisors (see below), whose sum is σ = 30666192. Its totient is φ = 30634872.
The previous prime is 30650527. The next prime is 30650549. The reversal of 30650531 is 13505603.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13505603 = 79 ⋅170957.
It is a cyclic number.
It is not a de Polignac number, because 30650531 - 22 = 30650527 is a prime.
It is a super-2 number, since 2×306505312 = 1878910101163922, 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 = 30650497 and 30650506.
It is not an unprimeable number, because it can be changed into a prime (30650551) 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 3 ways as a sum of consecutive naturals, for example, 4391 + ... + 8976.
It is an arithmetic number, because the mean of its divisors is an integer number (7666548).
Almost surely, 230650531 is an apocalyptic number.
30650531 is a deficient number, since it is larger than the sum of its proper divisors (15661).
30650531 is a wasteful number, since it uses less digits than its factorization.
30650531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15660.
The product of its (nonzero) digits is 1350, while the sum is 23.
The square root of 30650531 is about 5536.2921707583. The cubic root of 30650531 is about 312.9531550440.
The spelling of 30650531 in words is "thirty million, six hundred fifty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •