Base | Representation |
---|---|
bin | 1001100001010011… |
… | …11000010000111111 |
3 | 111012012201111122210 |
4 | 10300221320100333 |
5 | 40431440031111 |
6 | 2203103511503 |
7 | 240442632264 |
oct | 46051702077 |
9 | 14165644583 |
10 | 5111252031 |
11 | 2193194336 |
12 | ba78b8593 |
13 | 635c11ab2 |
14 | 366b8126b |
15 | 1edad00a6 |
hex | 130a7843f |
5111252031 has 8 divisors (see below), whose sum is σ = 6821694720. Its totient is φ = 3404155352.
The previous prime is 5111252017. The next prime is 5111252087. The reversal of 5111252031 is 1302521115.
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 5111252031 - 227 = 4977034303 is a prime.
It is a super-2 number, since 2×51112520312 = 52249794648803249922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5111251989 and 5111252007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111252431) 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, 832935 + ... + 839048.
It is an arithmetic number, because the mean of its divisors is an integer number (852711840).
Almost surely, 25111252031 is an apocalyptic number.
5111252031 is a deficient number, since it is larger than the sum of its proper divisors (1710442689).
5111252031 is a wasteful number, since it uses less digits than its factorization.
5111252031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1673005.
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 5111252031 is about 71493.0208551856. The cubic root of 5111252031 is about 1722.5655816110.
Adding to 5111252031 its reverse (1302521115), we get a palindrome (6413773146).
The spelling of 5111252031 in words is "five billion, one hundred eleven million, two hundred fifty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •