Base | Representation |
---|---|
bin | 1001010010011001001101… |
… | …1010110110100100100101 |
3 | 1100011012221200211010021221 |
4 | 2110212103122312210211 |
5 | 2314301334300140423 |
6 | 33415052113340341 |
7 | 2102523141354031 |
oct | 224462332664445 |
9 | 40135850733257 |
10 | 10211610552613 |
11 | 32877a0a39248 |
12 | 118b0b38676b1 |
13 | 590c48a23b72 |
14 | 27435d2131c1 |
15 | 12a96285ae5d |
hex | 949936b6925 |
10211610552613 has 2 divisors, whose sum is σ = 10211610552614. Its totient is φ = 10211610552612.
The previous prime is 10211610552443. The next prime is 10211610552653. The reversal of 10211610552613 is 31625501611201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6748263498564 + 3463347054049 = 2597742^2 + 1861007^2 .
It is an emirp because it is prime and its reverse (31625501611201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10211610552613 is a prime.
It is a super-2 number, since 2×102116105526132 (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 (10211610552653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105805276306 + 5105805276307.
It is an arithmetic number, because the mean of its divisors is an integer number (5105805276307).
Almost surely, 210211610552613 is an apocalyptic number.
It is an amenable number.
10211610552613 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211610552613 is an equidigital number, since it uses as much as digits as its factorization.
10211610552613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 34.
The spelling of 10211610552613 in words is "ten trillion, two hundred eleven billion, six hundred ten million, five hundred fifty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •