Base | Representation |
---|---|
bin | 10110111101110000100110… |
… | …101111110100000100110101 |
3 | 111020121121111101110121020001 |
4 | 112331300212233310010311 |
5 | 101214300223324013023 |
6 | 554451133143311301 |
7 | 30163042303223623 |
oct | 2675604657640465 |
9 | 436547441417201 |
10 | 101001101001013 |
11 | 2a200365470464 |
12 | b3b283444b531 |
13 | 4448494552c75 |
14 | 1ad269d578513 |
15 | ba240ca186ad |
hex | 5bdc26bf4135 |
101001101001013 has 4 divisors (see below), whose sum is σ = 101001140407840. Its totient is φ = 101001061594188.
The previous prime is 101001101000977. The next prime is 101001101001023. The reversal of 101001101001013 is 310100101100101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101001101001013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001101001023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15569793 + ... + 21081286.
It is an arithmetic number, because the mean of its divisors is an integer number (25250285101960).
Almost surely, 2101001101001013 is an apocalyptic number.
It is an amenable number.
101001101001013 is a deficient number, since it is larger than the sum of its proper divisors (39406827).
101001101001013 is an equidigital number, since it uses as much as digits as its factorization.
101001101001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39406826.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 101001101001013 its reverse (310100101100101), we get a palindrome (411101202101114).
The spelling of 101001101001013 in words is "one hundred one trillion, one billion, one hundred one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •