Base | Representation |
---|---|
bin | 1101101111001111001000… |
… | …01011000111010000001111 |
3 | 10221222002011001112212220212 |
4 | 12313213210023013100033 |
5 | 12424431230234030221 |
6 | 144130234015433035 |
7 | 6235424134342163 |
oct | 667474413072017 |
9 | 127862131485825 |
10 | 30210333111311 |
11 | 9698148506771 |
12 | 347ab6b52577b |
13 | 13b1a8c46a872 |
14 | 76628b942ca3 |
15 | 375c904aab5b |
hex | 1b79e42c740f |
30210333111311 has 8 divisors (see below), whose sum is σ = 30634877512944. Its totient is φ = 29786078013120.
The previous prime is 30210333111289. The next prime is 30210333111313. The reversal of 30210333111311 is 11311133301203.
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 30210333111311 - 218 = 30210332849167 is a prime.
It is a super-2 number, since 2×302103331113112 (a number of 28 digits) contains 22 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 (30210333111313) 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, 72115541 + ... + 72533246.
It is an arithmetic number, because the mean of its divisors is an integer number (3829359689118).
Almost surely, 230210333111311 is an apocalyptic number.
30210333111311 is a deficient number, since it is larger than the sum of its proper divisors (424544401633).
30210333111311 is a wasteful number, since it uses less digits than its factorization.
30210333111311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144651721.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 30210333111311 its reverse (11311133301203), we get a palindrome (41521466412514).
The spelling of 30210333111311 in words is "thirty trillion, two hundred ten billion, three hundred thirty-three million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.644 sec. • engine limits •