Base | Representation |
---|---|
bin | 11000000000111001110000… |
… | …111011010011111100001101 |
3 | 111211221201010201121222100001 |
4 | 120000321300323103330031 |
5 | 102320344301420430010 |
6 | 1012342531541004301 |
7 | 31150304431110040 |
oct | 3000716073237415 |
9 | 454851121558301 |
10 | 105615140405005 |
11 | 3071a147417640 |
12 | ba18b089b3691 |
13 | 46c160780322a |
14 | 1c11b2b570c57 |
15 | c3245b159c3a |
hex | 600e70ed3f0d |
105615140405005 has 32 divisors (see below), whose sum is σ = 161373163991040. Its totient is φ = 64437200877120.
The previous prime is 105615140404987. The next prime is 105615140405083. The reversal of 105615140405005 is 500504041516501.
It is not a de Polignac number, because 105615140405005 - 223 = 105615132016397 is a prime.
It is a super-2 number, since 2×1056151404050052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2918333395 + ... + 2918369584.
It is an arithmetic number, because the mean of its divisors is an integer number (5042911374720).
Almost surely, 2105615140405005 is an apocalyptic number.
It is an amenable number.
105615140405005 is a deficient number, since it is larger than the sum of its proper divisors (55758023586035).
105615140405005 is a wasteful number, since it uses less digits than its factorization.
105615140405005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5836703049.
The product of its (nonzero) digits is 60000, while the sum is 37.
The spelling of 105615140405005 in words is "one hundred five trillion, six hundred fifteen billion, one hundred forty million, four hundred five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •