Base | Representation |
---|---|
bin | 10110110111010001001100… |
… | …101010010110110101011111 |
3 | 111012000222012001120202021102 |
4 | 112313101030222112311133 |
5 | 101134443230442142301 |
6 | 553510205043423315 |
7 | 30115602065454212 |
oct | 2667211452266537 |
9 | 435028161522242 |
10 | 100555060505951 |
11 | 2a049186210747 |
12 | b3402b2384b3b |
13 | 44153bc58864c |
14 | 1ab8c68897779 |
15 | b95a041a1b6b |
hex | 5b744ca96d5f |
100555060505951 has 2 divisors, whose sum is σ = 100555060505952. Its totient is φ = 100555060505950.
The previous prime is 100555060505923. The next prime is 100555060505953. The reversal of 100555060505951 is 159505060555001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100555060505951 is a prime.
It is a super-2 number, since 2×1005550605059512 (a number of 29 digits) contains 22 as substring.
Together with 100555060505953, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 100555060505896 and 100555060505905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100555060505953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50277530252975 + 50277530252976.
It is an arithmetic number, because the mean of its divisors is an integer number (50277530252976).
Almost surely, 2100555060505951 is an apocalyptic number.
100555060505951 is a deficient number, since it is larger than the sum of its proper divisors (1).
100555060505951 is an equidigital number, since it uses as much as digits as its factorization.
100555060505951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 843750, while the sum is 47.
The spelling of 100555060505951 in words is "one hundred trillion, five hundred fifty-five billion, sixty million, five hundred five thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •