Base | Representation |
---|---|
bin | 1001010101001111… |
… | …10100110111000101 |
3 | 110221011021221020222 |
4 | 10222213310313011 |
5 | 40230033104001 |
6 | 2145050434125 |
7 | 235103504141 |
oct | 45247646705 |
9 | 13834257228 |
10 | 5010050501 |
11 | 2141052105 |
12 | b79a32945 |
13 | 61ac6a431 |
14 | 35755a221 |
15 | 1e4c8e61b |
hex | 12a9f4dc5 |
5010050501 has 8 divisors (see below), whose sum is σ = 5356263744. Its totient is φ = 4669560000.
The previous prime is 5010050483. The next prime is 5010050543. The reversal of 5010050501 is 1050500105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5010050501 - 222 = 5005856197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
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 5010050501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5010050401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1428875 + ... + 1432376.
It is an arithmetic number, because the mean of its divisors is an integer number (669532968).
Almost surely, 25010050501 is an apocalyptic number.
It is an amenable number.
5010050501 is a deficient number, since it is larger than the sum of its proper divisors (346213243).
5010050501 is a wasteful number, since it uses less digits than its factorization.
5010050501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2861371.
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 5010050501 is about 70781.7102152809. The cubic root of 5010050501 is about 1711.1209208456.
Adding to 5010050501 its reverse (1050500105), we get a palindrome (6060550606).
The spelling of 5010050501 in words is "five billion, ten million, fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •