Base | Representation |
---|---|
bin | 1001110010010101… |
… | …11111101111011011 |
3 | 111120011121112101001 |
4 | 10321022333233123 |
5 | 41230030314011 |
6 | 2225210405431 |
7 | 244126355605 |
oct | 47112775733 |
9 | 14504545331 |
10 | 5254151131 |
11 | 2256916569 |
12 | 1027730877 |
13 | 6596c5888 |
14 | 37bb3c175 |
15 | 20b40a7c1 |
hex | 1392bfbdb |
5254151131 has 8 divisors (see below), whose sum is σ = 5444022960. Its totient is φ = 5067640032.
The previous prime is 5254151113. The next prime is 5254151171. The reversal of 5254151131 is 1311514525.
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 5254151131 - 25 = 5254151099 is a prime.
It is a super-2 number, since 2×52541511312 = 55212208214777158322, which contains 22 as substring.
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 5254151131.
It is not an unprimeable number, because it can be changed into a prime (5254151101) 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, 837000 + ... + 843253.
It is an arithmetic number, because the mean of its divisors is an integer number (680502870).
Almost surely, 25254151131 is an apocalyptic number.
5254151131 is a deficient number, since it is larger than the sum of its proper divisors (189871829).
5254151131 is a wasteful number, since it uses less digits than its factorization.
5254151131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1680365.
The product of its digits is 3000, while the sum is 28.
The square root of 5254151131 is about 72485.5235960947. The cubic root of 5254151131 is about 1738.4712792862.
Adding to 5254151131 its reverse (1311514525), we get a palindrome (6565665656).
The spelling of 5254151131 in words is "five billion, two hundred fifty-four million, one hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •