Base | Representation |
---|---|
bin | 1101101111010000011010… |
… | …01100000101100010110111 |
3 | 10221222010221000101001110211 |
4 | 12313220031030011202313 |
5 | 12424434132413413221 |
6 | 144130430200330251 |
7 | 6235450161306643 |
oct | 667501514054267 |
9 | 127863830331424 |
10 | 30211021232311 |
11 | 9698470982207 |
12 | 347b121a73987 |
13 | 13b1b6bbab05a |
14 | 7663150a7c23 |
15 | 375cd0ad36e1 |
hex | 1b7a0d3058b7 |
30211021232311 has 8 divisors (see below), whose sum is σ = 31871901438000. Its totient is φ = 28557223672320.
The previous prime is 30211021232297. The next prime is 30211021232351. The reversal of 30211021232311 is 11323212011203.
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 30211021232311 - 219 = 30211020708023 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 (30211021232351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1770652660 + ... + 1770669721.
It is an arithmetic number, because the mean of its divisors is an integer number (3983987679750).
Almost surely, 230211021232311 is an apocalyptic number.
30211021232311 is a deficient number, since it is larger than the sum of its proper divisors (1660880205689).
30211021232311 is a wasteful number, since it uses less digits than its factorization.
30211021232311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3541322849.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 30211021232311 its reverse (11323212011203), we get a palindrome (41534233243514).
The spelling of 30211021232311 in words is "thirty trillion, two hundred eleven billion, twenty-one million, two hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •