Base | Representation |
---|---|
bin | 11101110110110111101111… |
… | …111011001100100011001011 |
3 | 122012221111112122111201210212 |
4 | 131312313233323030203023 |
5 | 114202422143431210011 |
6 | 1143140502505031335 |
7 | 36442061555006231 |
oct | 3566675773144313 |
9 | 565844478451725 |
10 | 131314060413131 |
11 | 38927a86830962 |
12 | 1288966518554b |
13 | 5836b2a6514bb |
14 | 245d8c4c68951 |
15 | 102aba7a8708b |
hex | 776defecc8cb |
131314060413131 has 2 divisors, whose sum is σ = 131314060413132. Its totient is φ = 131314060413130.
The previous prime is 131314060413121. The next prime is 131314060413139.
131314060413131 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131314060413131 is a prime.
It is a super-2 number, since 2×1313140604131312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131314060413139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65657030206565 + 65657030206566.
It is an arithmetic number, because the mean of its divisors is an integer number (65657030206566).
Almost surely, 2131314060413131 is an apocalyptic number.
131314060413131 is a deficient number, since it is larger than the sum of its proper divisors (1).
131314060413131 is an equidigital number, since it uses as much as digits as its factorization.
131314060413131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 131314060413131 in words is "one hundred thirty-one trillion, three hundred fourteen billion, sixty million, four hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •