Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1010111001100001101 |
3 | 100120101211122011202011 |
4 | 1131033001113030031 |
5 | 3120011130130010 |
6 | 113553452501221 |
7 | 10142551000543 |
oct | 1351701271415 |
9 | 316354564664 |
10 | 100110005005 |
11 | 3950254052a |
12 | 1749a77a811 |
13 | 959554716a |
14 | 4bb98d7d93 |
15 | 290dc18a8a |
hex | 174f05730d |
100110005005 has 8 divisors (see below), whose sum is σ = 120224352024. Its totient is φ = 80026440000.
The previous prime is 100110004997. The next prime is 100110005063. The reversal of 100110005005 is 500500011001.
It can be written as a sum of positive squares in 4 ways, for example, as 1512120996 + 98597884009 = 38886^2 + 314003^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100110005005 - 23 = 100110004997 is a prime.
It is a super-2 number, since 2×1001100050052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7688346 + ... + 7701355.
It is an arithmetic number, because the mean of its divisors is an integer number (15028044003).
Almost surely, 2100110005005 is an apocalyptic number.
It is an amenable number.
100110005005 is a deficient number, since it is larger than the sum of its proper divisors (20114347019).
100110005005 is a wasteful number, since it uses less digits than its factorization.
100110005005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15391007.
The product of its (nonzero) digits is 25, while the sum is 13.
Adding to 100110005005 its reverse (500500011001), we get a palindrome (600610016006).
The spelling of 100110005005 in words is "one hundred billion, one hundred ten million, five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •