Base | Representation |
---|---|
bin | 1100100001111… |
… | …10010110110011 |
3 | 21022210021221111 |
4 | 12100332112303 |
5 | 203402104021 |
6 | 14232534151 |
7 | 2414305633 |
oct | 620762663 |
9 | 238707844 |
10 | 105113011 |
11 | 54373a63 |
12 | 2b251357 |
13 | 18a13b63 |
14 | dd626c3 |
15 | 93648e1 |
hex | 643e5b3 |
105113011 has 4 divisors (see below), whose sum is σ = 105657832. Its totient is φ = 104568192.
The previous prime is 105113003. The next prime is 105113039. The reversal of 105113011 is 110311501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110311501 = 1741 ⋅63361.
It is a cyclic number.
It is not a de Polignac number, because 105113011 - 23 = 105113003 is a prime.
It is a super-2 number, since 2×1051130112 = 22097490162972242, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105112982 and 105113000.
It is not an unprimeable number, because it can be changed into a prime (105113311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 272121 + ... + 272506.
It is an arithmetic number, because the mean of its divisors is an integer number (26414458).
Almost surely, 2105113011 is an apocalyptic number.
105113011 is a deficient number, since it is larger than the sum of its proper divisors (544821).
105113011 is an equidigital number, since it uses as much as digits as its factorization.
105113011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544820.
The product of its (nonzero) digits is 15, while the sum is 13.
The square root of 105113011 is about 10252.4636551416. The cubic root of 105113011 is about 471.9385917309.
Adding to 105113011 its reverse (110311501), we get a palindrome (215424512).
The spelling of 105113011 in words is "one hundred five million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •