Base | Representation |
---|---|
bin | 1101101010000001001000… |
… | …11110001100110101100111 |
3 | 10221022221022122101010222011 |
4 | 12311000210132030311213 |
5 | 12414012013421332221 |
6 | 143512021150415051 |
7 | 6216445515450625 |
oct | 665004436146547 |
9 | 127287278333864 |
10 | 30031023230311 |
11 | 96290a3785174 |
12 | 3450268b01487 |
13 | 139abb47b606c |
14 | 75b71b66c515 |
15 | 3712986721e1 |
hex | 1b502478cd67 |
30031023230311 has 8 divisors (see below), whose sum is σ = 30733539224960. Its totient is φ = 29328694513272.
The previous prime is 30031023230287. The next prime is 30031023230317. The reversal of 30031023230311 is 11303232013003.
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 30031023230311 - 27 = 30031023230183 is a prime.
It is a super-3 number, since 3×300310232303113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30031023230317) 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, 46494915 + ... + 47136388.
It is an arithmetic number, because the mean of its divisors is an integer number (3841692403120).
Almost surely, 230031023230311 is an apocalyptic number.
30031023230311 is a deficient number, since it is larger than the sum of its proper divisors (702515994649).
30031023230311 is an equidigital number, since it uses as much as digits as its factorization.
30031023230311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93638805.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 30031023230311 its reverse (11303232013003), we get a palindrome (41334255243314).
The spelling of 30031023230311 in words is "thirty trillion, thirty-one billion, twenty-three million, two hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •