Base | Representation |
---|---|
bin | 110000111101011011… |
… | …1001011101100111111 |
3 | 101001101102101212101011 |
4 | 1201322313023230333 |
5 | 3210311432020221 |
6 | 120144553500051 |
7 | 10411323341536 |
oct | 1417267135477 |
9 | 331342355334 |
10 | 105140501311 |
11 | 4065408789a |
12 | 18463411627 |
13 | 9bb77c28b1 |
14 | 5135a5731d |
15 | 2b056961e1 |
hex | 187adcbb3f |
105140501311 has 4 divisors (see below), whose sum is σ = 107704903824. Its totient is φ = 102576098800.
The previous prime is 105140501303. The next prime is 105140501351. The reversal of 105140501311 is 113105041501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113105041501 = 1069 ⋅105804529.
It is a cyclic number.
It is not a de Polignac number, because 105140501311 - 23 = 105140501303 is a prime.
It is a super-2 number, since 2×1051405013112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105140501351) 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, 1282201195 + ... + 1282201276.
It is an arithmetic number, because the mean of its divisors is an integer number (26926225956).
Almost surely, 2105140501311 is an apocalyptic number.
105140501311 is a deficient number, since it is larger than the sum of its proper divisors (2564402513).
105140501311 is an equidigital number, since it uses as much as digits as its factorization.
105140501311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2564402512.
The product of its (nonzero) digits is 300, while the sum is 22.
Adding to 105140501311 its reverse (113105041501), we get a palindrome (218245542812).
The spelling of 105140501311 in words is "one hundred five billion, one hundred forty million, five hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •