Base | Representation |
---|---|
bin | 11001001111011101000010… |
… | …001100101100010000111011 |
3 | 112120001202021220222201121111 |
4 | 121033131002030230100323 |
5 | 104022314342330314003 |
6 | 1032034421130421151 |
7 | 32245301600260636 |
oct | 3117350214542073 |
9 | 476052256881544 |
10 | 111013130323003 |
11 | 32410449a630a7 |
12 | 1054b1088917b7 |
13 | 49c365493b49c |
14 | 1d5b0c8158c1d |
15 | cc7a8da6ee6d |
hex | 64f74232c43b |
111013130323003 has 2 divisors, whose sum is σ = 111013130323004. Its totient is φ = 111013130323002.
The previous prime is 111013130322959. The next prime is 111013130323061. The reversal of 111013130323003 is 300323031310111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 111013130323003 - 245 = 75828758234171 is a prime.
It is a super-3 number, since 3×1110131303230033 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (111013130323093) 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, 55506565161501 + 55506565161502.
It is an arithmetic number, because the mean of its divisors is an integer number (55506565161502).
Almost surely, 2111013130323003 is an apocalyptic number.
111013130323003 is a deficient number, since it is larger than the sum of its proper divisors (1).
111013130323003 is an equidigital number, since it uses as much as digits as its factorization.
111013130323003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 111013130323003 its reverse (300323031310111), we get a palindrome (411336161633114).
The spelling of 111013130323003 in words is "one hundred eleven trillion, thirteen billion, one hundred thirty million, three hundred twenty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •