Base | Representation |
---|---|
bin | 101111011010010111… |
… | …1101100101100101101 |
3 | 100201210202222202022002 |
4 | 1132310233230230231 |
5 | 3132010030304131 |
6 | 114435100102045 |
7 | 10233053151524 |
oct | 1366457545455 |
9 | 321722882262 |
10 | 101816650541 |
11 | 3a1a8932591 |
12 | 17896234925 |
13 | 97a7cac4a8 |
14 | 4cdc42d4bb |
15 | 29ad9816cb |
hex | 17b4becb2d |
101816650541 has 2 divisors, whose sum is σ = 101816650542. Its totient is φ = 101816650540.
The previous prime is 101816650477. The next prime is 101816650583. The reversal of 101816650541 is 145056618101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73037224516 + 28779426025 = 270254^2 + 169645^2 .
It is an emirp because it is prime and its reverse (145056618101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101816650541 - 26 = 101816650477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101816650495 and 101816650504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101816650141) 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, 50908325270 + 50908325271.
It is an arithmetic number, because the mean of its divisors is an integer number (50908325271).
Almost surely, 2101816650541 is an apocalyptic number.
It is an amenable number.
101816650541 is a deficient number, since it is larger than the sum of its proper divisors (1).
101816650541 is an equidigital number, since it uses as much as digits as its factorization.
101816650541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 38.
The spelling of 101816650541 in words is "one hundred one billion, eight hundred sixteen million, six hundred fifty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •