Base | Representation |
---|---|
bin | 110001001011010011… |
… | …1010101101101100001 |
3 | 101002120212112020111020 |
4 | 1202112213111231201 |
5 | 3212240131010144 |
6 | 120303105240053 |
7 | 10426006060446 |
oct | 1422647255541 |
9 | 332525466436 |
10 | 105606110049 |
11 | 40872994600 |
12 | 18573333029 |
13 | 9c600c601b |
14 | 517b8199cd |
15 | 2b314b9419 |
hex | 18969d5b61 |
105606110049 has 24 divisors (see below), whose sum is σ = 154898975616. Its totient is φ = 63951439200.
The previous prime is 105606110003. The next prime is 105606110059. The reversal of 105606110049 is 940011606501.
It is not a de Polignac number, because 105606110049 - 29 = 105606109537 is a prime.
It is a super-3 number, since 3×1056061100493 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105606110059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 328687 + ... + 565019.
It is an arithmetic number, because the mean of its divisors is an integer number (6454123984).
Almost surely, 2105606110049 is an apocalyptic number.
It is an amenable number.
105606110049 is a deficient number, since it is larger than the sum of its proper divisors (49292865567).
105606110049 is a wasteful number, since it uses less digits than its factorization.
105606110049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237589 (or 237578 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 33.
The spelling of 105606110049 in words is "one hundred five billion, six hundred six million, one hundred ten thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •