Base | Representation |
---|---|
bin | 101111000101000000… |
… | …1111011101000010101 |
3 | 100122221211111122022000 |
4 | 1132022001323220111 |
5 | 3124023100310010 |
6 | 114240020025513 |
7 | 10206231622521 |
oct | 1361201735025 |
9 | 318854448260 |
10 | 101100010005 |
11 | 39970357985 |
12 | 17716232299 |
13 | 96c2694b37 |
14 | 4c711a2d81 |
15 | 296aac37c0 |
hex | 178a07ba15 |
101100010005 has 16 divisors (see below), whose sum is σ = 179733351360. Its totient is φ = 53920005264.
The previous prime is 101100010003. The next prime is 101100010009. The reversal of 101100010005 is 500010001101.
It is not a de Polignac number, because 101100010005 - 21 = 101100010003 is a prime.
It is a super-2 number, since 2×1011000100052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100010003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 374444347 + ... + 374444616.
It is an arithmetic number, because the mean of its divisors is an integer number (11233334460).
Almost surely, 2101100010005 is an apocalyptic number.
101100010005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101100010005 is a deficient number, since it is larger than the sum of its proper divisors (78633341355).
101100010005 is an equidigital number, since it uses as much as digits as its factorization.
101100010005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 748888977 (or 748888971 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 101100010005 its reverse (500010001101), we get a palindrome (601110011106).
The spelling of 101100010005 in words is "one hundred one billion, one hundred million, ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •