Base | Representation |
---|---|
bin | 110000111001001111… |
… | …1001110111101111101 |
3 | 101001000122000221100122 |
4 | 1201302133032331331 |
5 | 3210020000134001 |
6 | 120123014304325 |
7 | 10404666215006 |
oct | 1416237167575 |
9 | 331018027318 |
10 | 105000005501 |
11 | 40591847256 |
12 | 184243580a5 |
13 | 9b94670991 |
14 | 51211241ad |
15 | 2ae8192b1b |
hex | 18727cef7d |
105000005501 has 6 divisors (see below), whose sum is σ = 110817180702. Its totient is φ = 99473689080.
The previous prime is 105000005491. The next prime is 105000005533. The reversal of 105000005501 is 105500000501.
It can be written as a sum of positive squares in only one way, i.e., 62463005476 + 42537000025 = 249926^2 + 206245^2 .
It is not a de Polignac number, because 105000005501 - 222 = 104995811197 is a prime.
It is a super-2 number, since 2×1050000055012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105000005501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105000005101) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 145429010 + ... + 145429731.
It is an arithmetic number, because the mean of its divisors is an integer number (18469530117).
Almost surely, 2105000005501 is an apocalyptic number.
It is an amenable number.
105000005501 is a deficient number, since it is larger than the sum of its proper divisors (5817175201).
105000005501 is an equidigital number, since it uses as much as digits as its factorization.
105000005501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290858779 (or 290858760 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 17.
The spelling of 105000005501 in words is "one hundred five billion, five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •