Base | Representation |
---|---|
bin | 10011110000001110… |
… | …01111101111100101 |
3 | 1000101002100220021200 |
4 | 21320013033233211 |
5 | 133204401200010 |
6 | 4512200033113 |
7 | 523542601623 |
oct | 117007175745 |
9 | 30332326250 |
10 | 10605100005 |
11 | 4552336665 |
12 | 207b762799 |
13 | 1000180506 |
14 | 728676513 |
15 | 421086cc0 |
hex | 2781cfbe5 |
10605100005 has 12 divisors (see below), whose sum is σ = 18382173420. Its totient is φ = 5656053312.
The previous prime is 10605100001. The next prime is 10605100007. The reversal of 10605100005 is 50000150601.
It can be written as a sum of positive squares in 2 ways, for example, as 7811554689 + 2793545316 = 88383^2 + 52854^2 .
It is not a de Polignac number, because 10605100005 - 22 = 10605100001 is a prime.
It is a super-2 number, since 2×106051000052 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10605100001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 117834400 + ... + 117834489.
It is an arithmetic number, because the mean of its divisors is an integer number (1531847785).
Almost surely, 210605100005 is an apocalyptic number.
10605100005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10605100005 is a deficient number, since it is larger than the sum of its proper divisors (7777073415).
10605100005 is a wasteful number, since it uses less digits than its factorization.
10605100005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235668900 (or 235668897 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
Adding to 10605100005 its reverse (50000150601), we get a palindrome (60605250606).
The spelling of 10605100005 in words is "ten billion, six hundred five million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •