Base | Representation |
---|---|
bin | 101111000010010111… |
… | …0110010100011100001 |
3 | 100122201122012211221201 |
4 | 1132010232302203201 |
5 | 3123332320343032 |
6 | 114223122321201 |
7 | 10204102143313 |
oct | 1360456624341 |
9 | 318648184851 |
10 | 101011106017 |
11 | 39925155008 |
12 | 176b04b9201 |
13 | 96aa137a23 |
14 | 4c6345d7b3 |
15 | 2962db18e7 |
hex | 1784bb28e1 |
101011106017 has 8 divisors (see below), whose sum is σ = 101298600000. Its totient is φ = 100723755504.
The previous prime is 101011105961. The next prime is 101011106047. The reversal of 101011106017 is 710601110101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101011106017 is a prime.
It is a super-2 number, since 2×1010111060172 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101011105985 and 101011106003.
It is not an unprimeable number, because it can be changed into a prime (101011106047) 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, 1462734 + ... + 1530232.
It is an arithmetic number, because the mean of its divisors is an integer number (12662325000).
Almost surely, 2101011106017 is an apocalyptic number.
It is an amenable number.
101011106017 is a deficient number, since it is larger than the sum of its proper divisors (287493983).
101011106017 is an equidigital number, since it uses as much as digits as its factorization.
101011106017 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71735.
The product of its (nonzero) digits is 42, while the sum is 19.
Adding to 101011106017 its reverse (710601110101), we get a palindrome (811612216118).
The spelling of 101011106017 in words is "one hundred one billion, eleven million, one hundred six thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •