Base | Representation |
---|---|
bin | 110000111010110100… |
… | …1111000110110000001 |
3 | 101001011022222221121212 |
4 | 1201311221320312001 |
5 | 3210122100130423 |
6 | 120132153055505 |
7 | 10406212605161 |
oct | 1416551706601 |
9 | 331138887555 |
10 | 105053130113 |
11 | 40609831598 |
12 | 1843a0b7595 |
13 | 9ba2681369 |
14 | 51281d25a1 |
15 | 2aecb88578 |
hex | 1875a78d81 |
105053130113 has 4 divisors (see below), whose sum is σ = 111232726020. Its totient is φ = 98873534208.
The previous prime is 105053130059. The next prime is 105053130163. The reversal of 105053130113 is 311031350501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 98481109489 + 6572020624 = 313817^2 + 81068^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105053130113 is a prime.
It is a super-2 number, since 2×1050531301132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105053130163) 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, 3089797928 + ... + 3089797961.
It is an arithmetic number, because the mean of its divisors is an integer number (27808181505).
Almost surely, 2105053130113 is an apocalyptic number.
It is an amenable number.
105053130113 is a deficient number, since it is larger than the sum of its proper divisors (6179595907).
105053130113 is an equidigital number, since it uses as much as digits as its factorization.
105053130113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6179595906.
The product of its (nonzero) digits is 675, while the sum is 23.
Adding to 105053130113 its reverse (311031350501), we get a palindrome (416084480614).
The spelling of 105053130113 in words is "one hundred five billion, fifty-three million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •