Base | Representation |
---|---|
bin | 10010110101111000… |
… | …01101001001110111 |
3 | 222002222102002210201 |
4 | 21122330031021313 |
5 | 131204102312201 |
6 | 4351433501331 |
7 | 505450514134 |
oct | 113274151167 |
9 | 28088362721 |
10 | 10115666551 |
11 | 4321037001 |
12 | 1b63871847 |
13 | c52957b13 |
14 | 6bd67158b |
15 | 3e3109801 |
hex | 25af0d277 |
10115666551 has 2 divisors, whose sum is σ = 10115666552. Its totient is φ = 10115666550.
The previous prime is 10115666521. The next prime is 10115666563. The reversal of 10115666551 is 15566651101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10115666551 - 27 = 10115666423 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10115666551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10115666521) 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, 5057833275 + 5057833276.
It is an arithmetic number, because the mean of its divisors is an integer number (5057833276).
Almost surely, 210115666551 is an apocalyptic number.
10115666551 is a deficient number, since it is larger than the sum of its proper divisors (1).
10115666551 is an equidigital number, since it uses as much as digits as its factorization.
10115666551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 10115666551 in words is "ten billion, one hundred fifteen million, six hundred sixty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •