Base | Representation |
---|---|
bin | 1001101110010001110100… |
… | …0000011100100011101101 |
3 | 1101212000110111100111101011 |
4 | 2123210131000130203231 |
5 | 2400123433011142411 |
6 | 34423115503145221 |
7 | 2152242345556366 |
oct | 233443500344355 |
9 | 41760414314334 |
10 | 10690660255981 |
11 | 345197a011802 |
12 | 1247b085a5211 |
13 | 5c71816401c4 |
14 | 28d605c60b6d |
15 | 13814e0adc21 |
hex | 9b91d01c8ed |
10690660255981 has 2 divisors, whose sum is σ = 10690660255982. Its totient is φ = 10690660255980.
The previous prime is 10690660255903. The next prime is 10690660256041. The reversal of 10690660255981 is 18955206609601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6508876562500 + 4181783693481 = 2551250^2 + 2044941^2 .
It is an emirp because it is prime and its reverse (18955206609601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10690660255981 - 27 = 10690660255853 is a prime.
It is a super-2 number, since 2×106906602559812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10690660255081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5345330127990 + 5345330127991.
It is an arithmetic number, because the mean of its divisors is an integer number (5345330127991).
Almost surely, 210690660255981 is an apocalyptic number.
It is an amenable number.
10690660255981 is a deficient number, since it is larger than the sum of its proper divisors (1).
10690660255981 is an equidigital number, since it uses as much as digits as its factorization.
10690660255981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6998400, while the sum is 58.
The spelling of 10690660255981 in words is "ten trillion, six hundred ninety billion, six hundred sixty million, two hundred fifty-five thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •