Base | Representation |
---|---|
bin | 11100001001111011… |
… | …010010111110000101 |
3 | 2220000212112200100001 |
4 | 130021323102332011 |
5 | 443403203411323 |
6 | 21515453521301 |
7 | 2120105616436 |
oct | 341173227605 |
9 | 86025480301 |
10 | 30231310213 |
11 | 119038718a5 |
12 | 5a384a3231 |
13 | 2b0a292850 |
14 | 166b05b48d |
15 | bbe0ba3ad |
hex | 709ed2f85 |
30231310213 has 8 divisors (see below), whose sum is σ = 32558160600. Its totient is φ = 27904654848.
The previous prime is 30231310211. The next prime is 30231310253. The reversal of 30231310213 is 31201313203.
It can be written as a sum of positive squares in 4 ways, for example, as 12981639969 + 17249670244 = 113937^2 + 131338^2 .
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 30231310213 - 21 = 30231310211 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 (30231310211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 512973 + ... + 568861.
It is an arithmetic number, because the mean of its divisors is an integer number (4069770075).
Almost surely, 230231310213 is an apocalyptic number.
It is an amenable number.
30231310213 is a deficient number, since it is larger than the sum of its proper divisors (2326850387).
30231310213 is a wasteful number, since it uses less digits than its factorization.
30231310213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97511.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30231310213 its reverse (31201313203), we get a palindrome (61432623416).
The spelling of 30231310213 in words is "thirty billion, two hundred thirty-one million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •