Base | Representation |
---|---|
bin | 10010101000000110… |
… | …00000111011111101 |
3 | 221210220210012012222 |
4 | 21110003000323331 |
5 | 130440000323010 |
6 | 4332142535125 |
7 | 502544456015 |
oct | 112403007375 |
9 | 27726705188 |
10 | 10000011005 |
11 | 4271822306 |
12 | 1b30b974a5 |
13 | c349c249a |
14 | 6ac166c45 |
15 | 3d7db1355 |
hex | 2540c0efd |
10000011005 has 8 divisors (see below), whose sum is σ = 12017742552. Its totient is φ = 7988189248.
The previous prime is 10000010971. The next prime is 10000011017. The reversal of 10000011005 is 50011000001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2672993401 + 7327017604 = 51701^2 + 85598^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10000011005 is a prime.
It is a super-2 number, since 2×100000110052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10000010983 and 10000011001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1473722 + ... + 1480491.
It is an arithmetic number, because the mean of its divisors is an integer number (1502217819).
Almost surely, 210000011005 is an apocalyptic number.
It is an amenable number.
10000011005 is a deficient number, since it is larger than the sum of its proper divisors (2017731547).
10000011005 is an equidigital number, since it uses as much as digits as its factorization.
10000011005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2954895.
The product of its (nonzero) digits is 5, while the sum is 8.
Adding to 10000011005 its reverse (50011000001), we get a palindrome (60011011006).
The spelling of 10000011005 in words is "ten billion, eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •