Base | Representation |
---|---|
bin | 110000111011001011… |
… | …1011000001100011101 |
3 | 101001012011102210111112 |
4 | 1201312113120030131 |
5 | 3210133123230010 |
6 | 120133300431405 |
7 | 10406416142501 |
oct | 1416627301435 |
9 | 331164383445 |
10 | 105065055005 |
11 | 40615536979 |
12 | 184420a8565 |
13 | 9ba4c98101 |
14 | 5129a18301 |
15 | 2aedc41a05 |
hex | 18765d831d |
105065055005 has 8 divisors (see below), whose sum is σ = 126236261592. Its totient is φ = 83946580288.
The previous prime is 105065054929. The next prime is 105065055031. The reversal of 105065055005 is 500550560501.
It can be written as a sum of positive squares in 4 ways, for example, as 127283524 + 104937771481 = 11282^2 + 323941^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105065055005 - 232 = 100770087709 is a prime.
It is a super-2 number, since 2×1050650550052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13178582 + ... + 13186551.
It is an arithmetic number, because the mean of its divisors is an integer number (15779532699).
Almost surely, 2105065055005 is an apocalyptic number.
It is an amenable number.
105065055005 is a deficient number, since it is larger than the sum of its proper divisors (21171206587).
105065055005 is an equidigital number, since it uses as much as digits as its factorization.
105065055005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26365935.
The product of its (nonzero) digits is 18750, while the sum is 32.
The spelling of 105065055005 in words is "one hundred five billion, sixty-five million, fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •