Base | Representation |
---|---|
bin | 11100001001111110… |
… | …110011110001101101 |
3 | 2220000221021110110001 |
4 | 130021332303301231 |
5 | 443403422343041 |
6 | 21515525344301 |
7 | 2120116503136 |
oct | 341176636155 |
9 | 86027243401 |
10 | 30232231021 |
11 | 119043406a3 |
12 | 5a38868091 |
13 | 2b0a5259c5 |
14 | 166b21ac8d |
15 | bbe1ed131 |
hex | 709fb3c6d |
30232231021 has 8 divisors (see below), whose sum is σ = 31901135040. Its totient is φ = 28592865312.
The previous prime is 30232230983. The next prime is 30232231031. The reversal of 30232231021 is 12013223203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30232231021 - 213 = 30232222829 is a prime.
It is a super-2 number, since 2×302322310212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30232231021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30232231031) 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, 7382475 + ... + 7386568.
It is an arithmetic number, because the mean of its divisors is an integer number (3987641880).
Almost surely, 230232231021 is an apocalyptic number.
It is an amenable number.
30232231021 is a deficient number, since it is larger than the sum of its proper divisors (1668904019).
30232231021 is a wasteful number, since it uses less digits than its factorization.
30232231021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14769155.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 30232231021 its reverse (12013223203), we get a palindrome (42245454224).
The spelling of 30232231021 in words is "thirty billion, two hundred thirty-two million, two hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •