Base | Representation |
---|---|
bin | 110000111010011100… |
… | …1100001111000000101 |
3 | 101001010110010220001210 |
4 | 1201310321201320011 |
5 | 3210110324000000 |
6 | 120131021242033 |
7 | 10406000056056 |
oct | 1416471417005 |
9 | 331113126053 |
10 | 105040453125 |
11 | 40602663143 |
12 | 18435a03319 |
13 | 9b9cb6319a |
14 | 512665272d |
15 | 2aeb9d2350 |
hex | 1874e61e05 |
105040453125 has 28 divisors (see below), whose sum is σ = 175065259136. Its totient is φ = 56021550000.
The previous prime is 105040453109. The next prime is 105040453159. The reversal of 105040453125 is 521354040501.
It is not a de Polignac number, because 105040453125 - 24 = 105040453109 is a prime.
It is a super-2 number, since 2×1050404531252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105040453092 and 105040453101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 1073557 + ... + 1167306.
Almost surely, 2105040453125 is an apocalyptic number.
105040453125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105040453125 is a deficient number, since it is larger than the sum of its proper divisors (70024806011).
105040453125 is an frugal number, since it uses more digits than its factorization.
105040453125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2240896 (or 2240871 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 105040453125 its reverse (521354040501), we get a palindrome (626394493626).
The spelling of 105040453125 in words is "one hundred five billion, forty million, four hundred fifty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •