Base | Representation |
---|---|
bin | 11110101001110110100… |
… | …00010110110100000001 |
3 | 10201200122120122012211212 |
4 | 33110323100112310001 |
5 | 114224034322143014 |
6 | 2123510025215505 |
7 | 136044535616243 |
oct | 17247320266401 |
9 | 3650576565755 |
10 | 1053261131009 |
11 | 37675a4a4a3a |
12 | 150167031595 |
13 | 7842585ba89 |
14 | 38d99d16093 |
15 | 1c5e758223e |
hex | f53b416d01 |
1053261131009 has 2 divisors, whose sum is σ = 1053261131010. Its totient is φ = 1053261131008.
The previous prime is 1053261130967. The next prime is 1053261131029. The reversal of 1053261131009 is 9001311623501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1035102760000 + 18158371009 = 1017400^2 + 134753^2 .
It is an emirp because it is prime and its reverse (9001311623501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1053261131009 - 216 = 1053261065473 is a prime.
It is a super-2 number, since 2×10532611310092 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1053261131029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526630565504 + 526630565505.
It is an arithmetic number, because the mean of its divisors is an integer number (526630565505).
Almost surely, 21053261131009 is an apocalyptic number.
It is an amenable number.
1053261131009 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053261131009 is an equidigital number, since it uses as much as digits as its factorization.
1053261131009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 1053261131009 in words is "one trillion, fifty-three billion, two hundred sixty-one million, one hundred thirty-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •