Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001001110000101000010001 |
3 | 111020222011121111020121001121 |
4 | 112333031233021300220101 |
5 | 101222420023100310001 |
6 | 555005112033202241 |
7 | 30203212335614110 |
oct | 2677155711605021 |
9 | 436864544217047 |
10 | 101101100010001 |
11 | 2a239810289a43 |
12 | b40a0a1a00381 |
13 | 4454a3caa65c0 |
14 | 1ad746841bc77 |
15 | ba4d11b096a1 |
hex | 5bf36f270a11 |
101101100010001 has 32 divisors (see below), whose sum is σ = 128010772431360. Its totient is φ = 77720825355264.
The previous prime is 101101100009971. The next prime is 101101100010007. The reversal of 101101100010001 is 100010001101101.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-101101100010001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (101101100010007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 101261896 + ... + 102255433.
It is an arithmetic number, because the mean of its divisors is an integer number (4000336638480).
Almost surely, 2101101100010001 is an apocalyptic number.
It is an amenable number.
101101100010001 is a deficient number, since it is larger than the sum of its proper divisors (26909672421359).
101101100010001 is a wasteful number, since it uses less digits than its factorization.
101101100010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203517505.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101101100010001 its reverse (100010001101101), we get a palindrome (201111101111102).
It can be divided in two parts, 101101 and 100010001, that multiplied together give a palindrome (10111111111101).
The spelling of 101101100010001 in words is "one hundred one trillion, one hundred one billion, one hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •