Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …110011100101001001101111 |
3 | 111020222011122020212120112001 |
4 | 112333031233303211021233 |
5 | 101222420033402114124 |
6 | 555005113104153131 |
7 | 30203212531034242 |
oct | 2677155763451157 |
9 | 436864566776461 |
10 | 101101110973039 |
11 | 2a239816497701 |
12 | b40a0a56087a7 |
13 | 4454a421445c8 |
14 | 1ad7469a73259 |
15 | ba4d12a72b44 |
hex | 5bf36fce526f |
101101110973039 has 2 divisors, whose sum is σ = 101101110973040. Its totient is φ = 101101110973038.
The previous prime is 101101110973019. The next prime is 101101110973069. The reversal of 101101110973039 is 930379011101101.
It is a weak prime.
It is an emirp because it is prime and its reverse (930379011101101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101101110973039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101101110972989 and 101101110973007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101101110973019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550555486519 + 50550555486520.
It is an arithmetic number, because the mean of its divisors is an integer number (50550555486520).
Almost surely, 2101101110973039 is an apocalyptic number.
101101110973039 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101110973039 is an equidigital number, since it uses as much as digits as its factorization.
101101110973039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103, while the sum is 37.
The spelling of 101101110973039 in words is "one hundred one trillion, one hundred one billion, one hundred ten million, nine hundred seventy-three thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •