Base | Representation |
---|---|
bin | 1001011111111101… |
… | …11101011011101001 |
3 | 111011102112220010222 |
4 | 10233332331123221 |
5 | 40421100013001 |
6 | 2202022415425 |
7 | 240245202404 |
oct | 45776753351 |
9 | 14142486128 |
10 | 5100001001 |
11 | 21878aa267 |
12 | ba3b91575 |
13 | 6337a2994 |
14 | 365492d3b |
15 | 1ecb0b61b |
hex | 12ffbd6e9 |
5100001001 has 8 divisors (see below), whose sum is σ = 5116535424. Its totient is φ = 5083492960.
The previous prime is 5100000943. The next prime is 5100001009. The reversal of 5100001001 is 1001000015.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5100001001 - 26 = 5100000937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5100001001.
It is not an unprimeable number, because it can be changed into a prime (5100001009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 425156 + ... + 436986.
It is an arithmetic number, because the mean of its divisors is an integer number (639566928).
Almost surely, 25100001001 is an apocalyptic number.
It is an amenable number.
5100001001 is a deficient number, since it is larger than the sum of its proper divisors (16534423).
5100001001 is a wasteful number, since it uses less digits than its factorization.
5100001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13191.
The product of its (nonzero) digits is 5, while the sum is 8.
The square root of 5100001001 is about 71414.2912938300. The cubic root of 5100001001 is about 1721.3007333421.
Adding to 5100001001 its reverse (1001000015), we get a palindrome (6101001016).
The spelling of 5100001001 in words is "five billion, one hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •