Base | Representation |
---|---|
bin | 10111111010101110101110… |
… | …101010010000101100111101 |
3 | 111210110011021212101100020110 |
4 | 113322232232222100230331 |
5 | 102241422103414013011 |
6 | 1011420022210340233 |
7 | 31104540256162320 |
oct | 2772565652205475 |
9 | 453404255340213 |
10 | 105190974360381 |
11 | 30576272781238 |
12 | b96a87058a679 |
13 | 469060a66ca00 |
14 | 1bd93adaac7b7 |
15 | c263d2dc1ba6 |
hex | 5fabaea90b3d |
105190974360381 has 384 divisors, whose sum is σ = 187161601536000. Its totient is φ = 51303534796800.
The previous prime is 105190974360379. The next prime is 105190974360389. The reversal of 105190974360381 is 183063479091501.
It is not a de Polignac number, because 105190974360381 - 21 = 105190974360379 is a prime.
It is a super-2 number, since 2×1051909743603812 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105190974360389) by changing a digit.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 194438029971 + ... + 194438030511.
It is an arithmetic number, because the mean of its divisors is an integer number (487400004000).
Almost surely, 2105190974360381 is an apocalyptic number.
It is an amenable number.
105190974360381 is a deficient number, since it is larger than the sum of its proper divisors (81970627175619).
105190974360381 is a wasteful number, since it uses less digits than its factorization.
105190974360381 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1045 (or 1032 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 57.
The spelling of 105190974360381 in words is "one hundred five trillion, one hundred ninety billion, nine hundred seventy-four million, three hundred sixty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •