Base | Representation |
---|---|
bin | 1101110010001101001000… |
… | …10101011111011111110011 |
3 | 10222022211110011222001110212 |
4 | 12321012210111133133303 |
5 | 12433114133333232311 |
6 | 144245144121214335 |
7 | 6245665034600561 |
oct | 671064425373763 |
9 | 128284404861425 |
10 | 30312341305331 |
11 | 9727434475748 |
12 | 34968999313ab |
13 | 13bb598033197 |
14 | 76b1a7592a31 |
15 | 378760b75c8b |
hex | 1b91a455f7f3 |
30312341305331 has 4 divisors (see below), whose sum is σ = 31051666703064. Its totient is φ = 29573015907600.
The previous prime is 30312341305283. The next prime is 30312341305333. The reversal of 30312341305331 is 13350314321303.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30312341305331 - 210 = 30312341304307 is a prime.
It is a super-2 number, since 2×303123413053312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30312341305333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 369662698805 + ... + 369662698886.
It is an arithmetic number, because the mean of its divisors is an integer number (7762916675766).
Almost surely, 230312341305331 is an apocalyptic number.
30312341305331 is a deficient number, since it is larger than the sum of its proper divisors (739325397733).
30312341305331 is an equidigital number, since it uses as much as digits as its factorization.
30312341305331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739325397732.
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 30312341305331 its reverse (13350314321303), we get a palindrome (43662655626634).
The spelling of 30312341305331 in words is "thirty trillion, three hundred twelve billion, three hundred forty-one million, three hundred five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •