Base | Representation |
---|---|
bin | 1001111000111001100100… |
… | …0100000010001010011101 |
3 | 1102111110110010201221122022 |
4 | 2132032121010002022131 |
5 | 2411121132312311121 |
6 | 35043014055225525 |
7 | 2201362205514554 |
oct | 236163104021235 |
9 | 42443403657568 |
10 | 10873130197661 |
11 | 35122a55976a6 |
12 | 12773513782a5 |
13 | 60b440bbb4b4 |
14 | 298395ac4d9b |
15 | 13cc7d556aab |
hex | 9e39910229d |
10873130197661 has 2 divisors, whose sum is σ = 10873130197662. Its totient is φ = 10873130197660.
The previous prime is 10873130197651. The next prime is 10873130197757. The reversal of 10873130197661 is 16679103137801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8233743302500 + 2639386895161 = 2869450^2 + 1624619^2 .
It is a cyclic number.
It is not a de Polignac number, because 10873130197661 - 26 = 10873130197597 is a prime.
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 (10873130197651) 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, 5436565098830 + 5436565098831.
It is an arithmetic number, because the mean of its divisors is an integer number (5436565098831).
Almost surely, 210873130197661 is an apocalyptic number.
It is an amenable number.
10873130197661 is a deficient number, since it is larger than the sum of its proper divisors (1).
10873130197661 is an equidigital number, since it uses as much as digits as its factorization.
10873130197661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 53.
The spelling of 10873130197661 in words is "ten trillion, eight hundred seventy-three billion, one hundred thirty million, one hundred ninety-seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •