Base | Representation |
---|---|
bin | 110000111001011011… |
… | …0010100001001000101 |
3 | 101001001001102100002101 |
4 | 1201302312110021011 |
5 | 3210023022243010 |
6 | 120123352112101 |
7 | 10405101514654 |
oct | 1416266241105 |
9 | 331031370071 |
10 | 105006056005 |
11 | 405951aa074 |
12 | 18426395631 |
13 | 9b959ab966 |
14 | 5121c5b19b |
15 | 2ae898a73a |
hex | 1872d94245 |
105006056005 has 8 divisors (see below), whose sum is σ = 126646899192. Its totient is φ = 83578423488.
The previous prime is 105006055993. The next prime is 105006056009. The reversal of 105006056005 is 500650600501.
It can be written as a sum of positive squares in 4 ways, for example, as 75894189121 + 29111866884 = 275489^2 + 170622^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 105006056005 - 213 = 105006047813 is a prime.
It is a super-2 number, since 2×1050060560052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105006056009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53301582 + ... + 53303551.
It is an arithmetic number, because the mean of its divisors is an integer number (15830862399).
Almost surely, 2105006056005 is an apocalyptic number.
It is an amenable number.
105006056005 is a deficient number, since it is larger than the sum of its proper divisors (21640843187).
105006056005 is a wasteful number, since it uses less digits than its factorization.
105006056005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106605335.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 105006056005 its reverse (500650600501), we get a palindrome (605656656506).
The spelling of 105006056005 in words is "one hundred five billion, six million, fifty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •