Base | Representation |
---|---|
bin | 110001001011001010… |
… | …0000011110100110011 |
3 | 101002120112000110201010 |
4 | 1202112110003310303 |
5 | 3212232332243201 |
6 | 120302405042003 |
7 | 10425615110661 |
oct | 1422624036463 |
9 | 332515013633 |
10 | 105601056051 |
11 | 40870052447 |
12 | 185716b6303 |
13 | 9c5c0467aa |
14 | 517aca1c31 |
15 | 2b30d1bbd6 |
hex | 1896503d33 |
105601056051 has 16 divisors (see below), whose sum is σ = 141782344704. Its totient is φ = 69911056704.
The previous prime is 105601056047. The next prime is 105601056073. The reversal of 105601056051 is 150650106501.
It is not a de Polignac number, because 105601056051 - 22 = 105601056047 is a prime.
It is a super-2 number, since 2×1056010560512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105601056751) 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 15 ways as a sum of consecutive naturals, for example, 415510 + ... + 619556.
It is an arithmetic number, because the mean of its divisors is an integer number (8861396544).
Almost surely, 2105601056051 is an apocalyptic number.
105601056051 is a deficient number, since it is larger than the sum of its proper divisors (36181288653).
105601056051 is a wasteful number, since it uses less digits than its factorization.
105601056051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205250.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 105601056051 in words is "one hundred five billion, six hundred one million, fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •