Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …00010101101101000001 |
3 | 10112121012001211110012021 |
4 | 32203110330111231001 |
5 | 112341002240000001 |
6 | 2043221305401441 |
7 | 132151025152210 |
oct | 16432474255501 |
9 | 3477161743167 |
10 | 1000005000001 |
11 | 356110830527 |
12 | 141983799281 |
13 | 733b9329617 |
14 | 36586d89077 |
15 | 1b02be02ba1 |
hex | e8d4f15b41 |
1000005000001 has 16 divisors (see below), whose sum is σ = 1148968259200. Its totient is φ = 852569515008.
The previous prime is 1000004999989. The next prime is 1000005000013.
1000005000001 is nontrivially palindromic in base 10.
1000005000001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1000004999989) and next prime (1000005000013).
It is a cyclic number.
It is not a de Polignac number, because 1000005000001 - 29 = 1000004999489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000005006001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8886355 + ... + 8998183.
It is an arithmetic number, because the mean of its divisors is an integer number (71810516200).
Almost surely, 21000005000001 is an apocalyptic number.
It is an amenable number.
1000005000001 is a deficient number, since it is larger than the sum of its proper divisors (148963259199).
1000005000001 is a wasteful number, since it uses less digits than its factorization.
1000005000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118648.
The product of its (nonzero) digits is 5, while the sum is 7.
The spelling of 1000005000001 in words is "one trillion, five million, one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •