Base | Representation |
---|---|
bin | 1001010100110001100101… |
… | …0100001110101101110111 |
3 | 1100022010112011111010020112 |
4 | 2111030121110032231313 |
5 | 2320434120441402421 |
6 | 33445534442253235 |
7 | 2105501540203445 |
oct | 225143124165567 |
9 | 40263464433215 |
10 | 10252511669111 |
11 | 32a307a611468 |
12 | 11970094b721b |
13 | 594a666a104a |
14 | 27631d34bb95 |
15 | 12ba584e045b |
hex | 9531950eb77 |
10252511669111 has 2 divisors, whose sum is σ = 10252511669112. Its totient is φ = 10252511669110.
The previous prime is 10252511669107. The next prime is 10252511669167. The reversal of 10252511669111 is 11196611525201.
It is a weak prime.
It is an emirp because it is prime and its reverse (11196611525201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10252511669111 - 22 = 10252511669107 is a prime.
It is a super-2 number, since 2×102525116691112 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10252511669711) 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, 5126255834555 + 5126255834556.
It is an arithmetic number, because the mean of its divisors is an integer number (5126255834556).
Almost surely, 210252511669111 is an apocalyptic number.
10252511669111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10252511669111 is an equidigital number, since it uses as much as digits as its factorization.
10252511669111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 41.
The spelling of 10252511669111 in words is "ten trillion, two hundred fifty-two billion, five hundred eleven million, six hundred sixty-nine thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •