Base | Representation |
---|---|
bin | 11101011111011011111… |
… | …11011001000101101101 |
3 | 10120212112022210012212201 |
4 | 32233231333121011231 |
5 | 113100224343220324 |
6 | 2053301440501501 |
7 | 133131525004216 |
oct | 16575577310555 |
9 | 3525468705781 |
10 | 1013310132589 |
11 | 360819175577 |
12 | 14447761a891 |
13 | 747299a5341 |
14 | 3708a06240d |
15 | 1b55a029444 |
hex | ebedfd916d |
1013310132589 has 2 divisors, whose sum is σ = 1013310132590. Its totient is φ = 1013310132588.
The previous prime is 1013310132587. The next prime is 1013310132599. The reversal of 1013310132589 is 9852310133101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 982705429225 + 30604703364 = 991315^2 + 174942^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013310132589 - 21 = 1013310132587 is a prime.
Together with 1013310132587, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013310132587) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506655066294 + 506655066295.
It is an arithmetic number, because the mean of its divisors is an integer number (506655066295).
Almost surely, 21013310132589 is an apocalyptic number.
It is an amenable number.
1013310132589 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013310132589 is an equidigital number, since it uses as much as digits as its factorization.
1013310132589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 37.
The spelling of 1013310132589 in words is "one trillion, thirteen billion, three hundred ten million, one hundred thirty-two thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •