Base | Representation |
---|---|
bin | 1001100001110001… |
… | …10000001010011001 |
3 | 111012111001121001002 |
4 | 10300320300022121 |
5 | 40433434313001 |
6 | 2203323234345 |
7 | 240521031452 |
oct | 46070601231 |
9 | 14174047032 |
10 | 5115151001 |
11 | 2195407724 |
12 | ba90789b5 |
13 | 63697868c |
14 | 3674b8129 |
15 | 1ee10046b |
hex | 130e30299 |
5115151001 has 4 divisors (see below), whose sum is σ = 5280155904. Its totient is φ = 4950146100.
The previous prime is 5115150977. The next prime is 5115151007. The reversal of 5115151001 is 1001515115.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5115151001 - 226 = 5048042137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5115151007) 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 in 3 ways as a sum of consecutive naturals, for example, 82502405 + ... + 82502466.
It is an arithmetic number, because the mean of its divisors is an integer number (1320038976).
Almost surely, 25115151001 is an apocalyptic number.
It is an amenable number.
5115151001 is a deficient number, since it is larger than the sum of its proper divisors (165004903).
5115151001 is a wasteful number, since it uses less digits than its factorization.
5115151001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165004902.
The product of its (nonzero) digits is 125, while the sum is 20.
The square root of 5115151001 is about 71520.2838431168. The cubic root of 5115151001 is about 1723.0034733088.
Adding to 5115151001 its reverse (1001515115), we get a palindrome (6116666116).
The spelling of 5115151001 in words is "five billion, one hundred fifteen million, one hundred fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •