Base | Representation |
---|---|
bin | 1001100110000110011100… |
… | …1111001101111000110101 |
3 | 1101100120211121101110222202 |
4 | 2121201213033031320311 |
5 | 2340323222430040034 |
6 | 34234403150234245 |
7 | 2136140042664545 |
oct | 231414717157065 |
9 | 41316747343882 |
10 | 10550171721269 |
11 | 33a8336992274 |
12 | 122483b1b5985 |
13 | 5b6b527ab91b |
14 | 2868b97c3325 |
15 | 13467a53b47e |
hex | 998673cde35 |
10550171721269 has 2 divisors, whose sum is σ = 10550171721270. Its totient is φ = 10550171721268.
The previous prime is 10550171721247. The next prime is 10550171721301. The reversal of 10550171721269 is 96212717105501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10075640866225 + 474530855044 = 3174215^2 + 688862^2 .
It is a cyclic number.
It is not a de Polignac number, because 10550171721269 - 28 = 10550171721013 is a prime.
It is a super-2 number, since 2×105501717212692 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10550171321269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5275085860634 + 5275085860635.
It is an arithmetic number, because the mean of its divisors is an integer number (5275085860635).
Almost surely, 210550171721269 is an apocalyptic number.
It is an amenable number.
10550171721269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10550171721269 is an equidigital number, since it uses as much as digits as its factorization.
10550171721269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 264600, while the sum is 47.
The spelling of 10550171721269 in words is "ten trillion, five hundred fifty billion, one hundred seventy-one million, seven hundred twenty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •