Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …000101010101100000010001 |
3 | 111020121111220121220222200212 |
4 | 112331233223011111200101 |
5 | 101214241201100310001 |
6 | 554450445544453505 |
7 | 30163005430024523 |
oct | 2675575305254021 |
9 | 436544817828625 |
10 | 101000100010001 |
11 | 2a1aa9a1430065 |
12 | b3b25b517a295 |
13 | 44483650599aa |
14 | 1ad260664da13 |
15 | ba239ebdd7bb |
hex | 5bdbeb155811 |
101000100010001 has 16 divisors (see below), whose sum is σ = 106479206031744. Its totient is φ = 95611667864064.
The previous prime is 101000100009979. The next prime is 101000100010039. The reversal of 101000100010001 is 100010001000101.
It is a de Polignac number, because none of the positive numbers 2k-101000100010001 is a prime.
It is a Duffinian number.
101000100010001 is a modest number, since divided by 100010001 gives 101 as remainder.
It is not an unprimeable number, because it can be changed into a prime (101000100010501) 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, 226172126 + ... + 226618248.
It is an arithmetic number, because the mean of its divisors is an integer number (6654950376984).
Almost surely, 2101000100010001 is an apocalyptic number.
It is an amenable number.
101000100010001 is a deficient number, since it is larger than the sum of its proper divisors (5479106021743).
101000100010001 is a wasteful number, since it uses less digits than its factorization.
101000100010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547720.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 101000100010001 its reverse (100010001000101), we get a palindrome (201010101010102).
It can be divided in two parts, 101000 and 100010001, that added together give a palindrome (100111001).
The spelling of 101000100010001 in words is "one hundred one trillion, one hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •