Base | Representation |
---|---|
bin | 11000001111000010… |
… | …11100110001110111 |
3 | 1020120202200220221011 |
4 | 30013201130301313 |
5 | 203121321023111 |
6 | 5551025133051 |
7 | 640266422212 |
oct | 140741346167 |
9 | 36522626834 |
10 | 13011111031 |
11 | 5577484326 |
12 | 263148a187 |
13 | 12c4792189 |
14 | 8b601c779 |
15 | 5123e9021 |
hex | 30785cc77 |
13011111031 has 2 divisors, whose sum is σ = 13011111032. Its totient is φ = 13011111030.
The previous prime is 13011110993. The next prime is 13011111059.
13011111031 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 13011111031 - 215 = 13011078263 is a prime.
It is a super-2 number, since 2×130111110312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13011111131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6505555515 + 6505555516.
It is an arithmetic number, because the mean of its divisors is an integer number (6505555516).
Almost surely, 213011111031 is an apocalyptic number.
13011111031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13011111031 is an equidigital number, since it uses as much as digits as its factorization.
13011111031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 13.
The spelling of 13011111031 in words is "thirteen billion, eleven million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •