Base | Representation |
---|---|
bin | 1101101110111111110100… |
… | …00011010011111100100111 |
3 | 10221221021220222202020202201 |
4 | 12313133322003103330213 |
5 | 12424312410204332221 |
6 | 144122354034515331 |
7 | 6235013306116165 |
oct | 667377203237447 |
9 | 127837828666681 |
10 | 30202110230311 |
11 | 9694708948548 |
12 | 3479455735b47 |
13 | 13b107b9bb8c6 |
14 | 765b0b81c235 |
15 | 37595d636891 |
hex | 1b77fa0d3f27 |
30202110230311 has 8 divisors (see below), whose sum is σ = 30303501739280. Its totient is φ = 30100827923712.
The previous prime is 30202110230291. The next prime is 30202110230339. The reversal of 30202110230311 is 11303201120203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30202110230311 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 (30202110230011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26746506 + ... + 27852823.
It is an arithmetic number, because the mean of its divisors is an integer number (3787937717410).
Almost surely, 230202110230311 is an apocalyptic number.
30202110230311 is a deficient number, since it is larger than the sum of its proper divisors (101391508969).
30202110230311 is a wasteful number, since it uses less digits than its factorization.
30202110230311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54601185.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30202110230311 its reverse (11303201120203), we get a palindrome (41505311350514).
The spelling of 30202110230311 in words is "thirty trillion, two hundred two billion, one hundred ten million, two hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •