Base | Representation |
---|---|
bin | 110000111001010000… |
… | …1010101001011011001 |
3 | 101001000200001212102210 |
4 | 1201302201111023121 |
5 | 3210020120231400 |
6 | 120123034145333 |
7 | 10405003664466 |
oct | 1416241251331 |
9 | 331020055383 |
10 | 105000555225 |
11 | 40592092275 |
12 | 18424582249 |
13 | 9b94803c67 |
14 | 512122866d |
15 | 2ae8250950 |
hex | 18728552d9 |
105000555225 has 24 divisors (see below), whose sum is σ = 173815076512. Its totient is φ = 55931212800.
The previous prime is 105000555169. The next prime is 105000555239. The reversal of 105000555225 is 522555000501.
It is not a de Polignac number, because 105000555225 - 212 = 105000551129 is a prime.
It is a super-2 number, since 2×1050005552252 (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 = 105000555192 and 105000555201.
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 23 ways as a sum of consecutive naturals, for example, 802312 + ... + 923961.
Almost surely, 2105000555225 is an apocalyptic number.
105000555225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105000555225 is a deficient number, since it is larger than the sum of its proper divisors (68814521287).
105000555225 is a wasteful number, since it uses less digits than its factorization.
105000555225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1727097 (or 1727092 counting only the distinct ones).
The product of its (nonzero) digits is 12500, while the sum is 30.
Adding to 105000555225 its reverse (522555000501), we get a palindrome (627555555726).
The spelling of 105000555225 in words is "one hundred five billion, five hundred fifty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •