Base | Representation |
---|---|
bin | 11001001111010001101111… |
… | …001111000010011101000101 |
3 | 112120000120222121112211120002 |
4 | 121033101233033002131011 |
5 | 104022120022224323023 |
6 | 1032025053401251045 |
7 | 32244362165650211 |
oct | 3117215717023505 |
9 | 476016877484502 |
10 | 111001001011013 |
11 | 3240629530a513 |
12 | 105488a2793a85 |
13 | 49c2470a6c3b9 |
14 | 1d5a6972b9941 |
15 | cc75cdca9b28 |
hex | 64f46f3c2745 |
111001001011013 has 2 divisors, whose sum is σ = 111001001011014. Its totient is φ = 111001001011012.
The previous prime is 111001001011007. The next prime is 111001001011037. The reversal of 111001001011013 is 310110100100111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109042924139044 + 1958076871969 = 10442362^2 + 1399313^2 .
It is a cyclic number.
It is not a de Polignac number, because 111001001011013 - 234 = 110983821141829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111001001010985 and 111001001011003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111001001011213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55500500505506 + 55500500505507.
It is an arithmetic number, because the mean of its divisors is an integer number (55500500505507).
Almost surely, 2111001001011013 is an apocalyptic number.
It is an amenable number.
111001001011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
111001001011013 is an equidigital number, since it uses as much as digits as its factorization.
111001001011013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 111001001011013 its reverse (310110100100111), we get a palindrome (421111101111124).
The spelling of 111001001011013 in words is "one hundred eleven trillion, one billion, one million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •