Base | Representation |
---|---|
bin | 1001010101100110001110… |
… | …0001100001100110100001 |
3 | 1100100110222220101110121211 |
4 | 2111121203201201212201 |
5 | 2321202040220221314 |
6 | 33500232515150121 |
7 | 2106511643321413 |
oct | 225314341414641 |
9 | 40313886343554 |
10 | 10266641570209 |
11 | 32a9070574282 |
12 | 11998b15a5341 |
13 | 5961a8b9267b |
14 | 276c9db9a9b3 |
15 | 12c0d3c329c4 |
hex | 956638619a1 |
10266641570209 has 2 divisors, whose sum is σ = 10266641570210. Its totient is φ = 10266641570208.
The previous prime is 10266641570203. The next prime is 10266641570221. The reversal of 10266641570209 is 90207514666201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7047416161809 + 3219225408400 = 2654697^2 + 1794220^2 .
It is a cyclic number.
It is not a de Polignac number, because 10266641570209 - 235 = 10232281831841 is a prime.
It is a super-2 number, since 2×102666415702092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10266641570203) 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, 5133320785104 + 5133320785105.
It is an arithmetic number, because the mean of its divisors is an integer number (5133320785105).
Almost surely, 210266641570209 is an apocalyptic number.
It is an amenable number.
10266641570209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10266641570209 is an equidigital number, since it uses as much as digits as its factorization.
10266641570209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 49.
The spelling of 10266641570209 in words is "ten trillion, two hundred sixty-six billion, six hundred forty-one million, five hundred seventy thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •