Base | Representation |
---|---|
bin | 10111111001011011000010… |
… | …011000111101011011100101 |
3 | 111210010120100010201111101120 |
4 | 113321123002120331123211 |
5 | 102233434033412243401 |
6 | 1011310441152044153 |
7 | 31065206336534466 |
oct | 2771330230753345 |
9 | 453116303644346 |
10 | 105101111056101 |
11 | 30541149235716 |
12 | b955371533659 |
13 | 4684cb8c6ba94 |
14 | 1bd4cc6dd4d6d |
15 | c23dc3a47836 |
hex | 5f96c263d6e5 |
105101111056101 has 16 divisors (see below), whose sum is σ = 141495980820480. Its totient is φ = 69386830426800.
The previous prime is 105101111056063. The next prime is 105101111056121. The reversal of 105101111056101 is 101650111101501.
It is a happy number.
It is not a de Polignac number, because 105101111056101 - 213 = 105101111047909 is a prime.
It is a super-2 number, since 2×1051011110561012 (a number of 29 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 (105101111056121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83310376 + ... + 84562526.
It is an arithmetic number, because the mean of its divisors is an integer number (8843498801280).
Almost surely, 2105101111056101 is an apocalyptic number.
It is an amenable number.
105101111056101 is a deficient number, since it is larger than the sum of its proper divisors (36394869764379).
105101111056101 is a wasteful number, since it uses less digits than its factorization.
105101111056101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1523896.
The product of its (nonzero) digits is 150, while the sum is 24.
Adding to 105101111056101 its reverse (101650111101501), we get a palindrome (206751222157602).
The spelling of 105101111056101 in words is "one hundred five trillion, one hundred one billion, one hundred eleven million, fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •