Base | Representation |
---|---|
bin | 1101101111010000111100… |
… | …11110010001001010000101 |
3 | 10221222011200020000111122111 |
4 | 12313220132132101022011 |
5 | 12424440231132224031 |
6 | 144130515035501021 |
7 | 6235460312141164 |
oct | 667503636211205 |
9 | 127864606014574 |
10 | 30211311211141 |
11 | 96985aa631635 |
12 | 347b1a2bb7771 |
13 | 13b1bb6caa768 |
14 | 7663417cd3db |
15 | 375ceb2b31b1 |
hex | 1b7a1e791285 |
30211311211141 has 2 divisors, whose sum is σ = 30211311211142. Its totient is φ = 30211311211140.
The previous prime is 30211311211121. The next prime is 30211311211181. The reversal of 30211311211141 is 14111211311203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26682751836225 + 3528559374916 = 5165535^2 + 1878446^2 .
It is a cyclic number.
It is not a de Polignac number, because 30211311211141 - 243 = 21415218188933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30211311211121) 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 as a sum of consecutive naturals, namely, 15105655605570 + 15105655605571.
It is an arithmetic number, because the mean of its divisors is an integer number (15105655605571).
Almost surely, 230211311211141 is an apocalyptic number.
It is an amenable number.
30211311211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211311211141 is an equidigital number, since it uses as much as digits as its factorization.
30211311211141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 30211311211141 its reverse (14111211311203), we get a palindrome (44322522522344).
The spelling of 30211311211141 in words is "thirty trillion, two hundred eleven billion, three hundred eleven million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •