Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001110010111100111111001 |
3 | 111020222011100120002202110002 |
4 | 112333031221032113213321 |
5 | 101222414322120230001 |
6 | 555005054121402345 |
7 | 30203210020351616 |
oct | 2677155116274771 |
9 | 436864316082402 |
10 | 101101000555001 |
11 | 2a23976a12aa27 |
12 | b40a0746393b5 |
13 | 4454a252c3ba5 |
14 | 1ad745912d50d |
15 | ba4d0801146b |
hex | 5bf3693979f9 |
101101000555001 has 2 divisors, whose sum is σ = 101101000555002. Its totient is φ = 101101000555000.
The previous prime is 101101000554943. The next prime is 101101000555013. The reversal of 101101000555001 is 100555000101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81894825779776 + 19206174775225 = 9049576^2 + 4382485^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101000555001 - 26 = 101101000554937 is a prime.
It is a super-2 number, since 2×1011010005550012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101101000545001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550500277500 + 50550500277501.
It is an arithmetic number, because the mean of its divisors is an integer number (50550500277501).
Almost surely, 2101101000555001 is an apocalyptic number.
It is an amenable number.
101101000555001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101000555001 is an equidigital number, since it uses as much as digits as its factorization.
101101000555001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 125, while the sum is 20.
Adding to 101101000555001 its reverse (100555000101101), we get a palindrome (201656000656102).
The spelling of 101101000555001 in words is "one hundred one trillion, one hundred one billion, five hundred fifty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •