Base | Representation |
---|---|
bin | 1001101000001110011010… |
… | …0111110011110100110001 |
3 | 1101111002001010201200020022 |
4 | 2122003212213303310301 |
5 | 2341422444131103123 |
6 | 34303240505253225 |
7 | 2141601342311501 |
oct | 232034647636461 |
9 | 41432033650208 |
10 | 10586668612913 |
11 | 3411865490138 |
12 | 122b925a94215 |
13 | 5ba41ab76ab3 |
14 | 28857ca23a01 |
15 | 1355b47001c8 |
hex | 9a0e69f3d31 |
10586668612913 has 2 divisors, whose sum is σ = 10586668612914. Its totient is φ = 10586668612912.
The previous prime is 10586668612843. The next prime is 10586668612921. The reversal of 10586668612913 is 31921686668501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10460489495824 + 126179117089 = 3234268^2 + 355217^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10586668612913 is a prime.
It is a super-2 number, since 2×105866686129132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10586668012913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5293334306456 + 5293334306457.
It is an arithmetic number, because the mean of its divisors is an integer number (5293334306457).
Almost surely, 210586668612913 is an apocalyptic number.
It is an amenable number.
10586668612913 is a deficient number, since it is larger than the sum of its proper divisors (1).
10586668612913 is an equidigital number, since it uses as much as digits as its factorization.
10586668612913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22394880, while the sum is 62.
The spelling of 10586668612913 in words is "ten trillion, five hundred eighty-six billion, six hundred sixty-eight million, six hundred twelve thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •