Base | Representation |
---|---|
bin | 1001100000000001… |
… | …10111011000010101 |
3 | 111011110111021022222 |
4 | 10300000313120111 |
5 | 40421212004001 |
6 | 2202041232125 |
7 | 240252352565 |
oct | 46000673025 |
9 | 14143437288 |
10 | 5100500501 |
11 | 2188110578 |
12 | ba4192645 |
13 | 633919145 |
14 | 365582da5 |
15 | 1ecba961b |
hex | 130037615 |
5100500501 has 2 divisors, whose sum is σ = 5100500502. Its totient is φ = 5100500500.
The previous prime is 5100500441. The next prime is 5100500521. The reversal of 5100500501 is 1050050015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3484540900 + 1615959601 = 59030^2 + 40199^2 .
It is a cyclic number.
It is not a de Polignac number, because 5100500501 - 222 = 5096306197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5100500501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5100500521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550250250 + 2550250251.
It is an arithmetic number, because the mean of its divisors is an integer number (2550250251).
Almost surely, 25100500501 is an apocalyptic number.
It is an amenable number.
5100500501 is a deficient number, since it is larger than the sum of its proper divisors (1).
5100500501 is an equidigital number, since it uses as much as digits as its factorization.
5100500501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 5100500501 is about 71417.7884073709. The cubic root of 5100500501 is about 1721.3569269029.
Adding to 5100500501 its reverse (1050050015), we get a palindrome (6150550516).
The spelling of 5100500501 in words is "five billion, one hundred million, five hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •