Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …010000011100101011100001 |
3 | 111020222011100121010110001021 |
4 | 112333031221100130223201 |
5 | 101222414322240200001 |
6 | 555005054141205441 |
7 | 30203210025111550 |
oct | 2677155120345341 |
9 | 436864317113037 |
10 | 101101001100001 |
11 | 2a23976a472441 |
12 | b40a074860881 |
13 | 4454a25454c86 |
14 | 1ad7459231d97 |
15 | ba4d080bcba1 |
hex | 5bf36941cae1 |
101101001100001 has 16 divisors (see below), whose sum is σ = 115668667428480. Its totient is φ = 86564504315520.
The previous prime is 101101001099921. The next prime is 101101001100019. The reversal of 101101001100001 is 100001100101101.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-101101001100001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101101001100041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 734361910 + ... + 734499568.
It is an arithmetic number, because the mean of its divisors is an integer number (7229291714280).
Almost surely, 2101101001100001 is an apocalyptic number.
It is an amenable number.
101101001100001 is a deficient number, since it is larger than the sum of its proper divisors (14567666328479).
101101001100001 is a wasteful number, since it uses less digits than its factorization.
101101001100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250104.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101101001100001 its reverse (100001100101101), we get a palindrome (201102101201102).
The spelling of 101101001100001 in words is "one hundred one trillion, one hundred one billion, one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •