Base | Representation |
---|---|
bin | 11000000011111000100111… |
… | …101111100110011110100001 |
3 | 111212200022002200202021220200 |
4 | 120003320213233212132201 |
5 | 102332224001140404031 |
6 | 1013021023003255413 |
7 | 31201151002503054 |
oct | 3003704757463641 |
9 | 455608080667820 |
10 | 105820071028641 |
11 | 30799049410302 |
12 | ba5077b81a569 |
13 | 4707a364a0288 |
14 | 1c1ba0c414a9b |
15 | c379523ce8e6 |
hex | 603e27be67a1 |
105820071028641 has 24 divisors (see below), whose sum is σ = 160633079418240. Its totient is φ = 67043765922336.
The previous prime is 105820071028489. The next prime is 105820071028663. The reversal of 105820071028641 is 146820170028501.
105820071028641 is a `hidden beast` number, since 1 + 0 + 582 + 0 + 0 + 7 + 1 + 0 + 2 + 8 + 64 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-105820071028641 is a prime.
It is a super-2 number, since 2×1058200710286412 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105820071028691) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3695078601 + ... + 3695107238.
It is an arithmetic number, because the mean of its divisors is an integer number (6693044975760).
Almost surely, 2105820071028641 is an apocalyptic number.
It is an amenable number.
105820071028641 is a deficient number, since it is larger than the sum of its proper divisors (54813008389599).
105820071028641 is a wasteful number, since it uses less digits than its factorization.
105820071028641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7390185925 (or 7390185922 counting only the distinct ones).
The product of its (nonzero) digits is 215040, while the sum is 45.
The spelling of 105820071028641 in words is "one hundred five trillion, eight hundred twenty billion, seventy-one million, twenty-eight thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •