Base | Representation |
---|---|
bin | 100100011000010011101… |
… | …0010001001001001000101 |
3 | 122200222212122222221011102 |
4 | 1020300213102021021011 |
5 | 1123410000224000010 |
6 | 14344545125545445 |
7 | 1024144454155454 |
oct | 110604722111105 |
9 | 18628778887142 |
10 | 5000001000005 |
11 | 165854123a910 |
12 | 68904a275285 |
13 | 2a366235449b |
14 | 134003966b9b |
15 | 8a0dc86cba5 |
hex | 48c27489245 |
5000001000005 has 16 divisors (see below), whose sum is σ = 6545531619648. Its totient is φ = 3636322272000.
The previous prime is 5000000999923. The next prime is 5000001000053.
5000001000005 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5000001000005 - 234 = 4982821130821 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (11).
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5000001000005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4744190 + ... + 5701520.
It is an arithmetic number, because the mean of its divisors is an integer number (409095726228).
Almost surely, 25000001000005 is an apocalyptic number.
5000001000005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5000001000005 is a deficient number, since it is larger than the sum of its proper divisors (1545530619643).
5000001000005 is a wasteful number, since it uses less digits than its factorization.
5000001000005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1052308.
The product of its (nonzero) digits is 25, while the sum is 11.
Multiplying 5000001000005 by its sum of digits (11), we get a palindrome (55000011000055).
The spelling of 5000001000005 in words is "five trillion, one million, five", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •