Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …010100101011010011001101 |
3 | 111020121121021001020022210221 |
4 | 112331300201110223103031 |
5 | 101214300032030013401 |
6 | 554451120133031341 |
7 | 30163040116565020 |
oct | 2675604124532315 |
9 | 436547231208727 |
10 | 101001010001101 |
11 | 2a200319066921 |
12 | b3b2809a85551 |
13 | 444847b740b72 |
14 | 1ad269144b1b7 |
15 | ba2404a407a1 |
hex | 5bdc2152b4cd |
101001010001101 has 8 divisors (see below), whose sum is σ = 115498969715520. Its totient is φ = 86520361286688.
The previous prime is 101001010001081. The next prime is 101001010001149. The reversal of 101001010001101 is 101100010100101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101001010001101 - 25 = 101001010001069 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 a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001010001501) 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, 4327737496 + ... + 4327760833.
It is an arithmetic number, because the mean of its divisors is an integer number (14437371214440).
Almost surely, 2101001010001101 is an apocalyptic number.
It is an amenable number.
101001010001101 is a deficient number, since it is larger than the sum of its proper divisors (14497959714419).
101001010001101 is an equidigital number, since it uses as much as digits as its factorization.
101001010001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8655500003.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101001010001101 its reverse (101100010100101), we get a palindrome (202101020101202).
The spelling of 101001010001101 in words is "one hundred one trillion, one billion, ten million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •