Base | Representation |
---|---|
bin | 1101110010110111101111… |
… | …00111000000001110001111 |
3 | 10222102000111011112210010220 |
4 | 12321123313213000032033 |
5 | 12434003004042204411 |
6 | 144303445442202423 |
7 | 6250434602051463 |
oct | 671336747001617 |
9 | 128360434483126 |
10 | 30335213241231 |
11 | 9736101045708 |
12 | 349b201653413 |
13 | 13c07a1703a72 |
14 | 76c3370664a3 |
15 | 37914dadab06 |
hex | 1b96f79c038f |
30335213241231 has 16 divisors (see below), whose sum is σ = 40598632823904. Its totient is φ = 20147654951424.
The previous prime is 30335213241169. The next prime is 30335213241247. The reversal of 30335213241231 is 13214231253303.
It is not a de Polignac number, because 30335213241231 - 210 = 30335213240207 is a prime.
It is a super-2 number, since 2×303352132412312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30335213241192 and 30335213241201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30335213241271) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3420931 + ... + 8507243.
It is an arithmetic number, because the mean of its divisors is an integer number (2537414551494).
Almost surely, 230335213241231 is an apocalyptic number.
30335213241231 is a deficient number, since it is larger than the sum of its proper divisors (10263419582673).
30335213241231 is a wasteful number, since it uses less digits than its factorization.
30335213241231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5093770.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 30335213241231 its reverse (13214231253303), we get a palindrome (43549444494534).
The spelling of 30335213241231 in words is "thirty trillion, three hundred thirty-five billion, two hundred thirteen million, two hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •