Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001001110000110111100011 |
3 | 111020222011121111020122101211 |
4 | 112333031233021300313203 |
5 | 101222420023100322404 |
6 | 555005112033210551 |
7 | 30203212335620005 |
oct | 2677155711606743 |
9 | 436864544218354 |
10 | 101101100010979 |
11 | 2a23981028a752 |
12 | b40a0a1a00a57 |
13 | 4454a3caa6b93 |
14 | 1ad746841c375 |
15 | ba4d11b09b04 |
hex | 5bf36f270de3 |
101101100010979 has 2 divisors, whose sum is σ = 101101100010980. Its totient is φ = 101101100010978.
The previous prime is 101101100010941. The next prime is 101101100011013. The reversal of 101101100010979 is 979010001101101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101101100010979 - 219 = 101101099486691 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101101100010979.
It is not a weakly prime, because it can be changed into another prime (101101100110979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550550005489 + 50550550005490.
It is an arithmetic number, because the mean of its divisors is an integer number (50550550005490).
Almost surely, 2101101100010979 is an apocalyptic number.
101101100010979 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101100010979 is an equidigital number, since it uses as much as digits as its factorization.
101101100010979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 31.
The spelling of 101101100010979 in words is "one hundred one trillion, one hundred one billion, one hundred million, ten thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •