Base | Representation |
---|---|
bin | 11101011111000110101… |
… | …00110100101100011101 |
3 | 10120212001212002120022021 |
4 | 32233203110310230131 |
5 | 113044343041420214 |
6 | 2053232005420141 |
7 | 133124223056533 |
oct | 16574324645435 |
9 | 3525055076267 |
10 | 1013131201309 |
11 | 360737172887 |
12 | 14442770a651 |
13 | 746cb8b6a46 |
14 | 370703a6153 |
15 | 1b549482924 |
hex | ebe3534b1d |
1013131201309 has 2 divisors, whose sum is σ = 1013131201310. Its totient is φ = 1013131201308.
The previous prime is 1013131201231. The next prime is 1013131201319. The reversal of 1013131201309 is 9031021313101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 962920251225 + 50210950084 = 981285^2 + 224078^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013131201309 - 219 = 1013130677021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013131201319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506565600654 + 506565600655.
It is an arithmetic number, because the mean of its divisors is an integer number (506565600655).
Almost surely, 21013131201309 is an apocalyptic number.
It is an amenable number.
1013131201309 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013131201309 is an equidigital number, since it uses as much as digits as its factorization.
1013131201309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 25.
The spelling of 1013131201309 in words is "one trillion, thirteen billion, one hundred thirty-one million, two hundred one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •