Base | Representation |
---|---|
bin | 1101101111010000010111… |
… | …11111010101001101010101 |
3 | 10221222010212121111210202012 |
4 | 12313220023333111031111 |
5 | 12424434112241031011 |
6 | 144130424201154005 |
7 | 6235446525265226 |
oct | 667501377251525 |
9 | 127863777453665 |
10 | 30211001111381 |
11 | 969846058a042 |
12 | 347b11718b905 |
13 | 13b1b6798488c |
14 | 76631254b24d |
15 | 375ccde5ba8b |
hex | 1b7a0bfd5355 |
30211001111381 has 2 divisors, whose sum is σ = 30211001111382. Its totient is φ = 30211001111380.
The previous prime is 30211001111227. The next prime is 30211001111453. The reversal of 30211001111381 is 18311110011203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29636537163025 + 574463948356 = 5443945^2 + 757934^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30211001111381 is a prime.
It is a super-2 number, since 2×302110011113812 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30211001101381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105500555690 + 15105500555691.
It is an arithmetic number, because the mean of its divisors is an integer number (15105500555691).
Almost surely, 230211001111381 is an apocalyptic number.
It is an amenable number.
30211001111381 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211001111381 is an equidigital number, since it uses as much as digits as its factorization.
30211001111381 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 23.
Adding to 30211001111381 its reverse (18311110011203), we get a palindrome (48522111122584).
The spelling of 30211001111381 in words is "thirty trillion, two hundred eleven billion, one million, one hundred eleven thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •