Base | Representation |
---|---|
bin | 110000111100100011… |
… | …1110011101100110101 |
3 | 101001022101110112120210 |
4 | 1201321013303230311 |
5 | 3210231443230023 |
6 | 120142032020033 |
7 | 10410520231251 |
oct | 1417107635465 |
9 | 331271415523 |
10 | 105111305013 |
11 | 40639656220 |
12 | 18455691619 |
13 | 9bb173c690 |
14 | 5131c17261 |
15 | 2b02d2a593 |
hex | 18791f3b35 |
105111305013 has 32 divisors (see below), whose sum is σ = 164799089280. Its totient is φ = 58750237440.
The previous prime is 105111304999. The next prime is 105111305023. The reversal of 105111305013 is 310503111501.
It is not a de Polignac number, because 105111305013 - 216 = 105111239477 is a prime.
It is a super-2 number, since 2×1051113050132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105111305023) 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, 365295 + ... + 586227.
It is an arithmetic number, because the mean of its divisors is an integer number (5149971540).
Almost surely, 2105111305013 is an apocalyptic number.
105111305013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
105111305013 is a deficient number, since it is larger than the sum of its proper divisors (59687784267).
105111305013 is a wasteful number, since it uses less digits than its factorization.
105111305013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222069.
The product of its (nonzero) digits is 225, while the sum is 21.
Adding to 105111305013 its reverse (310503111501), we get a palindrome (415614416514).
The spelling of 105111305013 in words is "one hundred five billion, one hundred eleven million, three hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •