Base | Representation |
---|---|
bin | 1011111010100110001001… |
… | …1001111001110000101101 |
3 | 1201101110202012121012021222 |
4 | 2332221202121321300231 |
5 | 3204122431102211112 |
6 | 43510353225033125 |
7 | 2521352312600456 |
oct | 276514231716055 |
9 | 51343665535258 |
10 | 13101301210157 |
11 | 41a1259a8a296 |
12 | 15771533257a5 |
13 | 7405a7c378a4 |
14 | 33416bc0012d |
15 | 17abdcc50372 |
hex | bea62679c2d |
13101301210157 has 2 divisors, whose sum is σ = 13101301210158. Its totient is φ = 13101301210156.
The previous prime is 13101301210133. The next prime is 13101301210177. The reversal of 13101301210157 is 75101210310131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12485862529156 + 615438681001 = 3533534^2 + 784499^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13101301210157 is a prime.
It is a super-2 number, since 2×131013012101572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13101301210117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550650605078 + 6550650605079.
It is an arithmetic number, because the mean of its divisors is an integer number (6550650605079).
Almost surely, 213101301210157 is an apocalyptic number.
It is an amenable number.
13101301210157 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101301210157 is an equidigital number, since it uses as much as digits as its factorization.
13101301210157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 630, while the sum is 26.
Adding to 13101301210157 its reverse (75101210310131), we get a palindrome (88202511520288).
The spelling of 13101301210157 in words is "thirteen trillion, one hundred one billion, three hundred one million, two hundred ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •