Base | Representation |
---|---|
bin | 11110101010000001001… |
… | …01011101101100101001 |
3 | 10201200212210220012001221 |
4 | 33111000211131230221 |
5 | 114224230220102223 |
6 | 2123522541542041 |
7 | 136050002643025 |
oct | 17250045355451 |
9 | 3650783805057 |
10 | 1053350550313 |
11 | 3767a5a19a96 |
12 | 150190b74921 |
13 | 7843b2395c9 |
14 | 38da7b51385 |
15 | 1c600346b5d |
hex | f54095db29 |
1053350550313 has 2 divisors, whose sum is σ = 1053350550314. Its totient is φ = 1053350550312.
The previous prime is 1053350550283. The next prime is 1053350550337. The reversal of 1053350550313 is 3130550533501.
1053350550313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1039763617344 + 13586932969 = 1019688^2 + 116563^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1053350550313 is a prime.
It is a super-2 number, since 2×10533505503132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1053350551313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526675275156 + 526675275157.
It is an arithmetic number, because the mean of its divisors is an integer number (526675275157).
Almost surely, 21053350550313 is an apocalyptic number.
It is an amenable number.
1053350550313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053350550313 is an equidigital number, since it uses as much as digits as its factorization.
1053350550313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50625, while the sum is 34.
The spelling of 1053350550313 in words is "one trillion, fifty-three billion, three hundred fifty million, five hundred fifty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •