Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …101110111010000010100001 |
3 | 111020121121020100121022001112 |
4 | 112331300200232322002201 |
5 | 101214300022011200001 |
6 | 554451115140513105 |
7 | 30163036636456601 |
oct | 2675604056720241 |
9 | 436547210538045 |
10 | 101001000100001 |
11 | 2a200313513aa1 |
12 | b3b28066ab795 |
13 | 4448479685321 |
14 | 1ad268ddd0c01 |
15 | ba2403c36cbb |
hex | 5bdc20bba0a1 |
101001000100001 has 8 divisors (see below), whose sum is σ = 101895627791880. Its totient is φ = 100106386680832.
The previous prime is 101001000099997. The next prime is 101001000100019. The reversal of 101001000100001 is 100001000100101.
It can be written as a sum of positive squares in 4 ways, for example, as 8845128053776 + 92155872046225 = 2974076^2 + 9599785^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101001000100001 - 22 = 101001000099997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101001050100001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10906421 + ... + 17915133.
It is an arithmetic number, because the mean of its divisors is an integer number (12736953473985).
Almost surely, 2101001000100001 is an apocalyptic number.
It is an amenable number.
101001000100001 is a deficient number, since it is larger than the sum of its proper divisors (894627691879).
101001000100001 is a wasteful number, since it uses less digits than its factorization.
101001000100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7136355.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 101001000100001 its reverse (100001000100101), we get a palindrome (201002000200102).
The spelling of 101001000100001 in words is "one hundred one trillion, one billion, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •