Base | Representation |
---|---|
bin | 1101110010110011101010… |
… | …00001010011010110001011 |
3 | 10222101210211110221110020112 |
4 | 12321121311001103112023 |
5 | 12433434012203220021 |
6 | 144302444215144535 |
7 | 6250326366404165 |
oct | 671316501232613 |
9 | 128353743843215 |
10 | 30333022320011 |
11 | 9735187357114 |
12 | 349a8ab97514b |
13 | 13c0512830888 |
14 | 76c1aa0ad935 |
15 | 3790715b3d5b |
hex | 1b967505358b |
30333022320011 has 8 divisors (see below), whose sum is σ = 30344007456000. Its totient is φ = 30322038813352.
The previous prime is 30333022320001. The next prime is 30333022320017. The reversal of 30333022320011 is 11002322033303.
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 30333022320011 - 214 = 30333022303627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30333022320017) 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, 37468490 + ... + 38269488.
It is an arithmetic number, because the mean of its divisors is an integer number (3793000932000).
Almost surely, 230333022320011 is an apocalyptic number.
30333022320011 is a deficient number, since it is larger than the sum of its proper divisors (10985135989).
30333022320011 is an equidigital number, since it uses as much as digits as its factorization.
30333022320011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 814665.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 30333022320011 its reverse (11002322033303), we get a palindrome (41335344353314).
The spelling of 30333022320011 in words is "thirty trillion, three hundred thirty-three billion, twenty-two million, three hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •