Base | Representation |
---|---|
bin | 11000000010100001110100… |
… | …001100010001000000100101 |
3 | 111212100101111221220110022020 |
4 | 120002201310030101000211 |
5 | 102324212104232041124 |
6 | 1012510130112253353 |
7 | 31161341154602142 |
oct | 3002416414210045 |
9 | 455311457813266 |
10 | 105726864330789 |
11 | 307625696916a9 |
12 | ba366a8b41259 |
13 | 46cc001205960 |
14 | 1c172c96a73c9 |
15 | c352e9780379 |
hex | 602874311025 |
105726864330789 has 32 divisors (see below), whose sum is σ = 157105162569600. Its totient is φ = 62796224682240.
The previous prime is 105726864330781. The next prime is 105726864330799. The reversal of 105726864330789 is 987033468627501.
It is not a de Polignac number, because 105726864330789 - 23 = 105726864330781 is a prime.
It is a super-2 number, since 2×1057268643307892 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105726864330781) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13952259 + ... + 20152400.
It is an arithmetic number, because the mean of its divisors is an integer number (4909536330300).
It is a 1-persistent number, because it is pandigital, but 2⋅105726864330789 = 211453728661578 is not.
Almost surely, 2105726864330789 is an apocalyptic number.
It is an amenable number.
105726864330789 is a deficient number, since it is larger than the sum of its proper divisors (51378298238811).
105726864330789 is a wasteful number, since it uses less digits than its factorization.
105726864330789 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34107445.
The product of its (nonzero) digits is 365783040, while the sum is 69.
The spelling of 105726864330789 in words is "one hundred five trillion, seven hundred twenty-six billion, eight hundred sixty-four million, three hundred thirty thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •