Base | Representation |
---|---|
bin | 10010101000001010… |
… | …10010000110100101 |
3 | 221210221220101212012 |
4 | 21110011102012211 |
5 | 130440123334410 |
6 | 4332203404005 |
7 | 502552513364 |
oct | 112405220645 |
9 | 27727811765 |
10 | 10000605605 |
11 | 4272099011 |
12 | 1b31223605 |
13 | c34b70013 |
14 | 6ac27d7db |
15 | 3d7e7c605 |
hex | 2541521a5 |
10000605605 has 4 divisors (see below), whose sum is σ = 12000726732. Its totient is φ = 8000484480.
The previous prime is 10000605541. The next prime is 10000605653. The reversal of 10000605605 is 50650600001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50650600001 = 1483 ⋅34154147.
It can be written as a sum of positive squares in 2 ways, for example, as 1900785604 + 8099820001 = 43598^2 + 89999^2 .
It is not a de Polignac number, because 10000605605 - 26 = 10000605541 is a prime.
It is a super-2 number, since 2×100006056052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1000060556 + ... + 1000060565.
It is an arithmetic number, because the mean of its divisors is an integer number (3000181683).
Almost surely, 210000605605 is an apocalyptic number.
It is an amenable number.
10000605605 is a deficient number, since it is larger than the sum of its proper divisors (2000121127).
10000605605 is an equidigital number, since it uses as much as digits as its factorization.
10000605605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000121126.
The product of its (nonzero) digits is 900, while the sum is 23.
The spelling of 10000605605 in words is "ten billion, six hundred five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •