Base | Representation |
---|---|
bin | 1101001101111011000000100… |
… | …1101011010110010010100011 |
3 | 11111222012210111212020021220102 |
4 | 3103132300021223112102203 |
5 | 1433402234023112023021 |
6 | 13054054314030133015 |
7 | 366624405215262623 |
oct | 32336601153262243 |
9 | 4458183455207812 |
10 | 930101100111011 |
11 | 24a3a4730366274 |
12 | 883979a865116b |
13 | 30bca207a4c77a |
14 | 125971c223c883 |
15 | 727e0e63e900b |
hex | 34dec09ad64a3 |
930101100111011 has 2 divisors, whose sum is σ = 930101100111012. Its totient is φ = 930101100111010.
The previous prime is 930101100110989. The next prime is 930101100111017. The reversal of 930101100111011 is 110111001101039.
930101100111011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (110111001101039) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-930101100111011 is a prime.
It is not a weakly prime, because it can be changed into another prime (930101100111017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 465050550055505 + 465050550055506.
It is an arithmetic number, because the mean of its divisors is an integer number (465050550055506).
Almost surely, 2930101100111011 is an apocalyptic number.
930101100111011 is a deficient number, since it is larger than the sum of its proper divisors (1).
930101100111011 is an equidigital number, since it uses as much as digits as its factorization.
930101100111011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 930101100111011 in words is "nine hundred thirty trillion, one hundred one billion, one hundred million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •