Base | Representation |
---|---|
bin | 110001000010101010… |
… | …1000101110111000101 |
3 | 101001211122211220111200 |
4 | 1202011111011313011 |
5 | 3211141411120421 |
6 | 120214225453113 |
7 | 10415555124510 |
oct | 1420525056705 |
9 | 331748756450 |
10 | 105316113861 |
11 | 40734223132 |
12 | 184b21a1199 |
13 | 9c14cbb74a |
14 | 51510cbd77 |
15 | 2b15cd4726 |
hex | 1885545dc5 |
105316113861 has 96 divisors (see below), whose sum is σ = 178885324800. Its totient is φ = 58468176000.
The previous prime is 105316113827. The next prime is 105316113869. The reversal of 105316113861 is 168311613501.
105316113861 is a `hidden beast` number, since 1 + 0 + 5 + 3 + 1 + 611 + 38 + 6 + 1 = 666.
It is not a de Polignac number, because 105316113861 - 27 = 105316113733 is a prime.
It is a super-2 number, since 2×1053161138612 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105316113869) 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 95 ways as a sum of consecutive naturals, for example, 146475460 + ... + 146476178.
It is an arithmetic number, because the mean of its divisors is an integer number (1863388800).
Almost surely, 2105316113861 is an apocalyptic number.
It is an amenable number.
105316113861 is a deficient number, since it is larger than the sum of its proper divisors (73569210939).
105316113861 is a wasteful number, since it uses less digits than its factorization.
105316113861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1199 (or 1196 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The spelling of 105316113861 in words is "one hundred five billion, three hundred sixteen million, one hundred thirteen thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •