Base | Representation |
---|---|
bin | 10111111111100101001101… |
… | …011010111011011000000101 |
3 | 111211122000210102012212002021 |
4 | 113333211031122323120011 |
5 | 102312402332200300010 |
6 | 1012233114540043141 |
7 | 31140611526565645 |
oct | 2777451532733005 |
9 | 454560712185067 |
10 | 105524350400005 |
11 | 30694697872059 |
12 | ba033ab5334b1 |
13 | 46b5b9911a594 |
14 | 1c0b59778a525 |
15 | c2ede577c8da |
hex | 5ff94d6bb605 |
105524350400005 has 4 divisors (see below), whose sum is σ = 126629220480012. Its totient is φ = 84419480320000.
The previous prime is 105524350399991. The next prime is 105524350400017. The reversal of 105524350400005 is 500004053425501.
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 49088211664804 + 56436138735201 = 7006298^2 + 7512399^2 .
It is not a de Polignac number, because 105524350400005 - 29 = 105524350399493 is a prime.
It is a super-2 number, since 2×1055243504000052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10552435039996 + ... + 10552435040005.
It is an arithmetic number, because the mean of its divisors is an integer number (31657305120003).
Almost surely, 2105524350400005 is an apocalyptic number.
It is an amenable number.
105524350400005 is a deficient number, since it is larger than the sum of its proper divisors (21104870080007).
105524350400005 is an equidigital number, since it uses as much as digits as its factorization.
105524350400005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21104870080006.
The product of its (nonzero) digits is 60000, while the sum is 34.
The spelling of 105524350400005 in words is "one hundred five trillion, five hundred twenty-four billion, three hundred fifty million, four hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •