Base | Representation |
---|---|
bin | 1101101111010000100110… |
… | …01001110111001001000011 |
3 | 10221222011011222200122102221 |
4 | 12313220103021313021003 |
5 | 12424434334023443243 |
6 | 144130444133351511 |
7 | 6235452515054260 |
oct | 667502311671103 |
9 | 127864158618387 |
10 | 30211121312323 |
11 | 9698512418866 |
12 | 347b14b498597 |
13 | 13b1b8684c0b3 |
14 | 7663244ba267 |
15 | 375cd97a1bed |
hex | 1b7a13277243 |
30211121312323 has 8 divisors (see below), whose sum is σ = 34531221404160. Its totient is φ = 25892077625160.
The previous prime is 30211121312291. The next prime is 30211121312327. The reversal of 30211121312323 is 32321312111203.
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 30211121312323 - 25 = 30211121312291 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30211121312327) 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, 264039883 + ... + 264154276.
It is an arithmetic number, because the mean of its divisors is an integer number (4316402675520).
Almost surely, 230211121312323 is an apocalyptic number.
30211121312323 is a deficient number, since it is larger than the sum of its proper divisors (4320100091837).
30211121312323 is an equidigital number, since it uses as much as digits as its factorization.
30211121312323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528202337.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 30211121312323 its reverse (32321312111203), we get a palindrome (62532433423526).
The spelling of 30211121312323 in words is "thirty trillion, two hundred eleven billion, one hundred twenty-one million, three hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •