Base | Representation |
---|---|
bin | 11100100011001001… |
… | …111000001100011101 |
3 | 2221010100222011010221 |
4 | 130203021320030131 |
5 | 1000240032004401 |
6 | 22025453401341 |
7 | 2133435326041 |
oct | 344311701435 |
9 | 87110864127 |
10 | 30654563101 |
11 | 12000779a78 |
12 | 5b36199251 |
13 | 2b76b86046 |
14 | 16ab356021 |
15 | be63237a1 |
hex | 72327831d |
30654563101 has 4 divisors (see below), whose sum is σ = 30700939804. Its totient is φ = 30608186400.
The previous prime is 30654563089. The next prime is 30654563117. The reversal of 30654563101 is 10136545603.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 16877907225 + 13776655876 = 129915^2 + 117374^2 .
It is a cyclic number.
It is not a de Polignac number, because 30654563101 - 211 = 30654561053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30654563141) 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 3 ways as a sum of consecutive naturals, for example, 23187360 + ... + 23188681.
It is an arithmetic number, because the mean of its divisors is an integer number (7675234951).
Almost surely, 230654563101 is an apocalyptic number.
It is an amenable number.
30654563101 is a deficient number, since it is larger than the sum of its proper divisors (46376703).
30654563101 is an equidigital number, since it uses as much as digits as its factorization.
30654563101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46376702.
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 30654563101 in words is "thirty billion, six hundred fifty-four million, five hundred sixty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •