Base | Representation |
---|---|
bin | 10111111000011101000110… |
… | …001101010010000010010001 |
3 | 111202220012200002021210122202 |
4 | 113320131012031102002101 |
5 | 102231341331344014140 |
6 | 1011220121444012545 |
7 | 31060333244402543 |
oct | 2770350615220221 |
9 | 452805602253582 |
10 | 105034603110545 |
11 | 30515a1a233859 |
12 | b9444b0091155 |
13 | 467b94a13b344 |
14 | 1bd19b80ad693 |
15 | c222cecc4915 |
hex | 5f8746352091 |
105034603110545 has 16 divisors (see below), whose sum is σ = 126770821965072. Its totient is φ = 83541489296640.
The previous prime is 105034603110539. The next prime is 105034603110601. The reversal of 105034603110545 is 545011306430501.
It can be written as a sum of positive squares in 8 ways, for example, as 313089487936 + 104721513622609 = 559544^2 + 10233353^2 .
It is not a de Polignac number, because 105034603110545 - 222 = 105034598916241 is a prime.
It is a super-2 number, since 2×1050346031105452 (a number of 29 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 = 105034603110499 and 105034603110508.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 262425275 + ... + 262825215.
It is an arithmetic number, because the mean of its divisors is an integer number (7923176372817).
Almost surely, 2105034603110545 is an apocalyptic number.
It is an amenable number.
105034603110545 is a deficient number, since it is larger than the sum of its proper divisors (21736218854527).
105034603110545 is a wasteful number, since it uses less digits than its factorization.
105034603110545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703732.
The product of its (nonzero) digits is 108000, while the sum is 38.
The spelling of 105034603110545 in words is "one hundred five trillion, thirty-four billion, six hundred three million, one hundred ten thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •