Base | Representation |
---|---|
bin | 11000000000000110100000… |
… | …010000110110011110110011 |
3 | 111211202110001212101222212120 |
4 | 120000012200100312132303 |
5 | 102313444041100141221 |
6 | 1012301350202125323 |
7 | 31143315453326643 |
oct | 3000064020663663 |
9 | 454673055358776 |
10 | 105560100005811 |
11 | 306a8872564020 |
12 | ba0a307ab0843 |
13 | 46b937572b499 |
14 | 1c0d1c9664523 |
15 | c30cd902d5c6 |
hex | 6001a04367b3 |
105560100005811 has 16 divisors (see below), whose sum is σ = 153724969601280. Its totient is φ = 63899565703520.
The previous prime is 105560100005807. The next prime is 105560100005849. The reversal of 105560100005811 is 118500001065501.
It is a cyclic number.
It is not a de Polignac number, because 105560100005811 - 22 = 105560100005807 is a prime.
It is a super-2 number, since 2×1055601000058112 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (105560100005411) 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, 1906283940 + ... + 1906339313.
It is an arithmetic number, because the mean of its divisors is an integer number (9607810600080).
Almost surely, 2105560100005811 is an apocalyptic number.
105560100005811 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105560100005811 is a deficient number, since it is larger than the sum of its proper divisors (48164869595469).
105560100005811 is a wasteful number, since it uses less digits than its factorization.
105560100005811 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3812624106.
The product of its (nonzero) digits is 6000, while the sum is 33.
The spelling of 105560100005811 in words is "one hundred five trillion, five hundred sixty billion, one hundred million, five thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •