Base | Representation |
---|---|
bin | 1101110010110000000101… |
… | …00100101101000000010111 |
3 | 10222101121212122221021121211 |
4 | 12321120002210231000113 |
5 | 12433421044132022221 |
6 | 144301525504522251 |
7 | 6250230663001654 |
oct | 671300244550027 |
9 | 128347778837554 |
10 | 30331102220311 |
11 | 9734391522862 |
12 | 349a454920387 |
13 | 13c0297ab03c9 |
14 | 76c067092c2b |
15 | 378eacc356e1 |
hex | 1b960292d017 |
30331102220311 has 8 divisors (see below), whose sum is σ = 31927904577200. Its totient is φ = 28734342719040.
The previous prime is 30331102220267. The next prime is 30331102220371. The reversal of 30331102220311 is 11302220113303.
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 30331102220311 - 213 = 30331102212119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30331102220371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9256056 + ... + 12096973.
It is an arithmetic number, because the mean of its divisors is an integer number (3990988072150).
Almost surely, 230331102220311 is an apocalyptic number.
30331102220311 is a deficient number, since it is larger than the sum of its proper divisors (1596802356889).
30331102220311 is a wasteful number, since it uses less digits than its factorization.
30331102220311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21427809.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30331102220311 its reverse (11302220113303), we get a palindrome (41633322333614).
The spelling of 30331102220311 in words is "thirty trillion, three hundred thirty-one billion, one hundred two million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •