Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …110111000010101000101011 |
3 | 111021000010110011212201010122 |
4 | 112333113003313002220223 |
5 | 101223101023420212341 |
6 | 555013445253433455 |
7 | 30204015406521206 |
oct | 2677270367025053 |
9 | 437003404781118 |
10 | 101111111100971 |
11 | 2a242a88289844 |
12 | b41001663b88b |
13 | 4455976b7807a |
14 | 1ad7b37c2a93d |
15 | ba51ea95894b |
hex | 5bf5c3dc2a2b |
101111111100971 has 2 divisors, whose sum is σ = 101111111100972. Its totient is φ = 101111111100970.
The previous prime is 101111111100953. The next prime is 101111111101001. The reversal of 101111111100971 is 179001111111101.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101111111100971 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101111111100971.
It is not a weakly prime, because it can be changed into another prime (101111111100071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555555550485 + 50555555550486.
It is an arithmetic number, because the mean of its divisors is an integer number (50555555550486).
Almost surely, 2101111111100971 is an apocalyptic number.
101111111100971 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111111100971 is an equidigital number, since it uses as much as digits as its factorization.
101111111100971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 26.
The spelling of 101111111100971 in words is "one hundred one trillion, one hundred eleven billion, one hundred eleven million, one hundred thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •