Base | Representation |
---|---|
bin | 11101011111111001100… |
… | …11110110001001111101 |
3 | 10120220011122122000021022 |
4 | 32233330303312021331 |
5 | 113101232020423112 |
6 | 2053342241513525 |
7 | 133140634226462 |
oct | 16577463661175 |
9 | 3526148560238 |
10 | 1013558764157 |
11 | 360936554105 |
12 | 1445269428a5 |
13 | 74769358c04 |
14 | 370b10a3669 |
15 | 1b571c8cd72 |
hex | ebfccf627d |
1013558764157 has 2 divisors, whose sum is σ = 1013558764158. Its totient is φ = 1013558764156.
The previous prime is 1013558764123. The next prime is 1013558764159. The reversal of 1013558764157 is 7514678553101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 574918798756 + 438639965401 = 758234^2 + 662299^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013558764157 is a prime.
Together with 1013558764159, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013558764099 and 1013558764108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013558764159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506779382078 + 506779382079.
It is an arithmetic number, because the mean of its divisors is an integer number (506779382079).
Almost surely, 21013558764157 is an apocalyptic number.
It is an amenable number.
1013558764157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013558764157 is an equidigital number, since it uses as much as digits as its factorization.
1013558764157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3528000, while the sum is 53.
The spelling of 1013558764157 in words is "one trillion, thirteen billion, five hundred fifty-eight million, seven hundred sixty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •