Base | Representation |
---|---|
bin | 1001100001110110… |
… | …11110000000111101 |
3 | 111012112101202212011 |
4 | 10300323132000331 |
5 | 40434130104401 |
6 | 2203350411221 |
7 | 240530055526 |
oct | 46073360075 |
9 | 14175352764 |
10 | 5115863101 |
11 | 2195853738 |
12 | ba9360b11 |
13 | 636b6783b |
14 | 36762184d |
15 | 1ee1e1451 |
hex | 130ede03d |
5115863101 has 2 divisors, whose sum is σ = 5115863102. Its totient is φ = 5115863100.
The previous prime is 5115863089. The next prime is 5115863111. The reversal of 5115863101 is 1013685115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4768040601 + 347822500 = 69051^2 + 18650^2 .
It is a cyclic number.
It is not a de Polignac number, because 5115863101 - 29 = 5115862589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5115863111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2557931550 + 2557931551.
It is an arithmetic number, because the mean of its divisors is an integer number (2557931551).
Almost surely, 25115863101 is an apocalyptic number.
It is an amenable number.
5115863101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5115863101 is an equidigital number, since it uses as much as digits as its factorization.
5115863101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 31.
The square root of 5115863101 is about 71525.2619778495. The cubic root of 5115863101 is about 1723.0834249297.
The spelling of 5115863101 in words is "five billion, one hundred fifteen million, eight hundred sixty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •