Base | Representation |
---|---|
bin | 100101000110111000000… |
… | …0011000000010000000001 |
3 | 200001120000012002010001202 |
4 | 1022031300003000100001 |
5 | 1132024303020003001 |
6 | 14502524352310545 |
7 | 1034314621605041 |
oct | 112156003002001 |
9 | 20046005063052 |
10 | 5100006016001 |
11 | 169699a491566 |
12 | 6a44b9842455 |
13 | 2acc0bbcc070 |
14 | 138bad531721 |
15 | 8c9e224896b |
hex | 4a3700c0401 |
5100006016001 has 4 divisors (see below), whose sum is σ = 5492314171092. Its totient is φ = 4707697860912.
The previous prime is 5100006015991. The next prime is 5100006016037. The reversal of 5100006016001 is 1006106000015.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1300566899776 + 3799439116225 = 1140424^2 + 1949215^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5100006016001 is a prime.
It is a super-2 number, since 2×51000060160012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5100006016201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 196154077526 + ... + 196154077551.
It is an arithmetic number, because the mean of its divisors is an integer number (1373078542773).
Almost surely, 25100006016001 is an apocalyptic number.
It is an amenable number.
5100006016001 is a deficient number, since it is larger than the sum of its proper divisors (392308155091).
5100006016001 is a wasteful number, since it uses less digits than its factorization.
5100006016001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392308155090.
The product of its (nonzero) digits is 180, while the sum is 20.
The spelling of 5100006016001 in words is "five trillion, one hundred billion, six million, sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •