Base | Representation |
---|---|
bin | 11100001000110110… |
… | …001101100010000000 |
3 | 2212222121110120210102 |
4 | 130020312031202000 |
5 | 443334034400000 |
6 | 21514005421532 |
7 | 2116465651124 |
oct | 341066154200 |
9 | 85877416712 |
10 | 30213200000 |
11 | 118a4622385 |
12 | 5a3240a8a8 |
13 | 2b065c1649 |
14 | 16688a5584 |
15 | bbc6de3d5 |
hex | 708d8d880 |
30213200000 has 96 divisors (see below), whose sum is σ = 75234130020. Its totient is φ = 12085120000.
The previous prime is 30213199987. The next prime is 30213200009. The reversal of 30213200000 is 231203.
It can be written as a sum of positive squares in 6 ways, for example, as 2131484224 + 28081715776 = 46168^2 + 167576^2 .
It is not an unprimeable number, because it can be changed into a prime (30213200009) 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 11 ways as a sum of consecutive naturals, for example, 362234 + ... + 437766.
Almost surely, 230213200000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30213200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37617065010).
30213200000 is an abundant number, since it is smaller than the sum of its proper divisors (45020930020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30213200000 is an frugal number, since it uses more digits than its factorization.
30213200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75572 (or 75540 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 11.
Adding to 30213200000 its reverse (231203), we get a palindrome (30213431203).
The spelling of 30213200000 in words is "thirty billion, two hundred thirteen million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •