Base | Representation |
---|---|
bin | 11100001000011000… |
… | …111011100011110101 |
3 | 2212222002000121121000 |
4 | 130020120323203311 |
5 | 443330103233323 |
6 | 21513133113513 |
7 | 2116343501544 |
oct | 341030734365 |
9 | 85862017530 |
10 | 30205524213 |
11 | 118a025a457 |
12 | 5a2b928899 |
13 | 2b04b34967 |
14 | 166786815b |
15 | bbbbc4e43 |
hex | 70863b8f5 |
30205524213 has 8 divisors (see below), whose sum is σ = 44748924800. Its totient is φ = 20137016124.
The previous prime is 30205524199. The next prime is 30205524247. The reversal of 30205524213 is 31242550203.
It is a happy number.
30205524213 is a `hidden beast` number, since 30 + 205 + 5 + 2 + 421 + 3 = 666.
It is a de Polignac number, because none of the positive numbers 2k-30205524213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1118723119 = 30205524213 / (3 + 0 + 2 + 0 + 5 + 5 + 2 + 4 + 2 + 1 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30205524253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 559361533 + ... + 559361586.
It is an arithmetic number, because the mean of its divisors is an integer number (5593615600).
Almost surely, 230205524213 is an apocalyptic number.
It is an amenable number.
30205524213 is a deficient number, since it is larger than the sum of its proper divisors (14543400587).
30205524213 is a wasteful number, since it uses less digits than its factorization.
30205524213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1118723128 (or 1118723122 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The spelling of 30205524213 in words is "thirty billion, two hundred five million, five hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •