Base | Representation |
---|---|
bin | 1101101111110100011000… |
… | …01001000010110000111111 |
3 | 10222000222202202010101212101 |
4 | 12313322030021002300333 |
5 | 12430243204214310421 |
6 | 144143342232045531 |
7 | 6240032532565141 |
oct | 667721411026077 |
9 | 128028682111771 |
10 | 30230331010111 |
11 | 96a567a830061 |
12 | 3482a108338a7 |
13 | 13b392858ac8b |
14 | 76722783cc91 |
15 | 376560e5e191 |
hex | 1b7e8c242c3f |
30230331010111 has 8 divisors (see below), whose sum is σ = 30257341426304. Its totient is φ = 30203326160280.
The previous prime is 30230331010109. The next prime is 30230331010129. The reversal of 30230331010111 is 11101013303203.
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 30230331010111 - 21 = 30230331010109 is a prime.
It is a super-3 number, since 3×302303310101113 (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 (30230331010181) 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, 9513190 + ... + 12286636.
It is an arithmetic number, because the mean of its divisors is an integer number (3782167678288).
Almost surely, 230230331010111 is an apocalyptic number.
30230331010111 is a deficient number, since it is larger than the sum of its proper divisors (27010416193).
30230331010111 is a wasteful number, since it uses less digits than its factorization.
30230331010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2783181.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30230331010111 its reverse (11101013303203), we get a palindrome (41331344313314).
The spelling of 30230331010111 in words is "thirty trillion, two hundred thirty billion, three hundred thirty-one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •