Base | Representation |
---|---|
bin | 11000000000110101100010… |
… | …100110000111011101100001 |
3 | 111211221021102122110120001002 |
4 | 120000311202212013131201 |
5 | 102320311004340004140 |
6 | 1012340501523321345 |
7 | 31150054146601361 |
oct | 3000654246073541 |
9 | 454837378416032 |
10 | 105610605000545 |
11 | 3071822a295097 |
12 | ba18061b20255 |
13 | 46c1063cb1858 |
14 | 1c1181b08a9a1 |
15 | c32292dc6415 |
hex | 600d62987761 |
105610605000545 has 16 divisors (see below), whose sum is σ = 130831838184960. Its totient is φ = 81756199200000.
The previous prime is 105610605000539. The next prime is 105610605000547. The reversal of 105610605000545 is 545000506016501.
It is a happy number.
It is not a de Polignac number, because 105610605000545 - 244 = 88018418956129 is a prime.
It is a super-2 number, since 2×1056106050005452 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105610605000499 and 105610605000508.
It is not an unprimeable number, because it can be changed into a prime (105610605000547) 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, 26684456 + ... + 30385545.
It is an arithmetic number, because the mean of its divisors is an integer number (8176989886560).
Almost surely, 2105610605000545 is an apocalyptic number.
It is an amenable number.
105610605000545 is a deficient number, since it is larger than the sum of its proper divisors (25221233184415).
105610605000545 is a wasteful number, since it uses less digits than its factorization.
105610605000545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57081976.
The product of its (nonzero) digits is 90000, while the sum is 38.
The spelling of 105610605000545 in words is "one hundred five trillion, six hundred ten billion, six hundred five million, five hundred forty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •