Base | Representation |
---|---|
bin | 110001001011010001… |
… | …1100000100101011101 |
3 | 101002120210122020012201 |
4 | 1202112203200211131 |
5 | 3212234401343023 |
6 | 120303031531501 |
7 | 10425664406311 |
oct | 1422643404535 |
9 | 332523566181 |
10 | 105605106013 |
11 | 40872369220 |
12 | 18572b29b91 |
13 | 9c5cb34014 |
14 | 517b637b41 |
15 | 2b3136bbad |
hex | 18968e095d |
105605106013 has 32 divisors (see below), whose sum is σ = 122631634944. Its totient is φ = 90039600000.
The previous prime is 105605106011. The next prime is 105605106041. The reversal of 105605106013 is 310601506501.
It is a cyclic number.
It is not a de Polignac number, because 105605106013 - 21 = 105605106011 is a prime.
It is a super-2 number, since 2×1056051060132 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105605106011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2086120 + ... + 2136142.
It is an arithmetic number, because the mean of its divisors is an integer number (3832238592).
Almost surely, 2105605106013 is an apocalyptic number.
It is an amenable number.
105605106013 is a deficient number, since it is larger than the sum of its proper divisors (17026528931).
105605106013 is a wasteful number, since it uses less digits than its factorization.
105605106013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50257.
The product of its (nonzero) digits is 2700, while the sum is 28.
The spelling of 105605106013 in words is "one hundred five billion, six hundred five million, one hundred six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •