Base | Representation |
---|---|
bin | 1101110010001000110101… |
… | …01001001110001000111111 |
3 | 10222022121111012010121221110 |
4 | 12321010122221032020333 |
5 | 12433044420443040221 |
6 | 144244123000133103 |
7 | 6245553554320002 |
oct | 671043251161077 |
9 | 128277435117843 |
10 | 30310031221311 |
11 | 97264594973a6 |
12 | 3496354167193 |
13 | 13bb2ba56a16a |
14 | 76b02885b539 |
15 | 378677e61776 |
hex | 1b911aa4e23f |
30310031221311 has 8 divisors (see below), whose sum is σ = 40445474549760. Its totient is φ = 20190637686872.
The previous prime is 30310031221307. The next prime is 30310031221321. The reversal of 30310031221311 is 11312213001303.
It is a happy number.
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 30310031221311 - 22 = 30310031221307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30310031221321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4012444095 + ... + 4012451648.
It is an arithmetic number, because the mean of its divisors is an integer number (5055684318720).
Almost surely, 230310031221311 is an apocalyptic number.
30310031221311 is a deficient number, since it is larger than the sum of its proper divisors (10135443328449).
30310031221311 is a wasteful number, since it uses less digits than its factorization.
30310031221311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8024897005.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 30310031221311 its reverse (11312213001303), we get a palindrome (41622244222614).
The spelling of 30310031221311 in words is "thirty trillion, three hundred ten billion, thirty-one million, two hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •