Base | Representation |
---|---|
bin | 11100001001111110… |
… | …011101100110110101 |
3 | 2220000221002211212210 |
4 | 130021332131212311 |
5 | 443403411441323 |
6 | 21515523404033 |
7 | 2120115644322 |
oct | 341176354665 |
9 | 86027084783 |
10 | 30232140213 |
11 | 11904289450 |
12 | 5a38823619 |
13 | 2b0a4c3582 |
14 | 166b1d5b49 |
15 | bbe1d1293 |
hex | 709f9d9b5 |
30232140213 has 32 divisors (see below), whose sum is σ = 46574946432. Its totient is φ = 17239449600.
The previous prime is 30232140209. The next prime is 30232140251. The reversal of 30232140213 is 31204123203.
It is not a de Polignac number, because 30232140213 - 22 = 30232140209 is a prime.
It is a super-3 number, since 3×302321402133 (a number of 32 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30232140213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30232145213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2525823 + ... + 2537763.
It is an arithmetic number, because the mean of its divisors is an integer number (1455467076).
Almost surely, 230232140213 is an apocalyptic number.
30232140213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
30232140213 is a deficient number, since it is larger than the sum of its proper divisors (16342806219).
30232140213 is a wasteful number, since it uses less digits than its factorization.
30232140213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16485.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 30232140213 its reverse (31204123203), we get a palindrome (61436263416).
The spelling of 30232140213 in words is "thirty billion, two hundred thirty-two million, one hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •