Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0000111011110100001 |
3 | 100122222112100012102121 |
4 | 1132022220013132201 |
5 | 3124033131120001 |
6 | 114241014344241 |
7 | 10206412663264 |
oct | 1361250073641 |
9 | 318875305377 |
10 | 101110020001 |
11 | 39975a74601 |
12 | 1771965b081 |
13 | 96c478b103 |
14 | 4c7264acdb |
15 | 296b8ee6a1 |
hex | 178aa077a1 |
101110020001 has 4 divisors (see below), whose sum is σ = 101117535892. Its totient is φ = 101102504112.
The previous prime is 101110019953. The next prime is 101110020017. The reversal of 101110020001 is 100020011101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 88312980625 + 12797039376 = 297175^2 + 113124^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110020001 - 231 = 98962536353 is a prime.
It is a super-2 number, since 2×1011100200012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101110027001) 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, 3737730 + ... + 3764683.
It is an arithmetic number, because the mean of its divisors is an integer number (25279383973).
Almost surely, 2101110020001 is an apocalyptic number.
It is an amenable number.
101110020001 is a deficient number, since it is larger than the sum of its proper divisors (7515891).
101110020001 is an equidigital number, since it uses as much as digits as its factorization.
101110020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7515890.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101110020001 its reverse (100020011101), we get a palindrome (201130031102).
The spelling of 101110020001 in words is "one hundred one billion, one hundred ten million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •