Base | Representation |
---|---|
bin | 101110110100011111… |
… | …0101011111010010101 |
3 | 100121112012010011202002 |
4 | 1131220332223322111 |
5 | 3121404122323221 |
6 | 114105011125045 |
7 | 10156416512522 |
oct | 1355076537225 |
9 | 317465104662 |
10 | 100545511061 |
11 | 39706357696 |
12 | 175a05a3785 |
13 | 963483a958 |
14 | 4c1b6a2149 |
15 | 293709280b |
hex | 1768fabe95 |
100545511061 has 2 divisors, whose sum is σ = 100545511062. Its totient is φ = 100545511060.
The previous prime is 100545511049. The next prime is 100545511063. The reversal of 100545511061 is 160115545001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72654507025 + 27891004036 = 269545^2 + 167006^2 .
It is an emirp because it is prime and its reverse (160115545001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100545511061 is a prime.
Together with 100545511063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100545511063) 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, 50272755530 + 50272755531.
It is an arithmetic number, because the mean of its divisors is an integer number (50272755531).
Almost surely, 2100545511061 is an apocalyptic number.
It is an amenable number.
100545511061 is a deficient number, since it is larger than the sum of its proper divisors (1).
100545511061 is an equidigital number, since it uses as much as digits as its factorization.
100545511061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 29.
The spelling of 100545511061 in words is "one hundred billion, five hundred forty-five million, five hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •