Base | Representation |
---|---|
bin | 1001110010000001… |
… | …11110011000100011 |
3 | 111112222200001210202 |
4 | 10321000332120203 |
5 | 41223342233011 |
6 | 2225034215415 |
7 | 244065134660 |
oct | 47100763043 |
9 | 14488601722 |
10 | 5251524131 |
11 | 2255391897 |
12 | 102688456b |
13 | 658cb5c39 |
14 | 37b656a67 |
15 | 20b08c23b |
hex | 13903e623 |
5251524131 has 16 divisors (see below), whose sum is σ = 6287308800. Its totient is φ = 4291062048.
The previous prime is 5251524127. The next prime is 5251524143. The reversal of 5251524131 is 1314251525.
It is not a de Polignac number, because 5251524131 - 22 = 5251524127 is a prime.
It is a super-2 number, since 2×52515241312 = 55157011396950610322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5251524094 and 5251524103.
It is not an unprimeable number, because it can be changed into a prime (5251524631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 147695 + ... + 179768.
It is an arithmetic number, because the mean of its divisors is an integer number (392956800).
Almost surely, 25251524131 is an apocalyptic number.
5251524131 is a deficient number, since it is larger than the sum of its proper divisors (1035784669).
5251524131 is a wasteful number, since it uses less digits than its factorization.
5251524131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327578.
The product of its digits is 6000, while the sum is 29.
The square root of 5251524131 is about 72467.4004708324. The cubic root of 5251524131 is about 1738.1814941057.
Adding to 5251524131 its reverse (1314251525), we get a palindrome (6565775656).
The spelling of 5251524131 in words is "five billion, two hundred fifty-one million, five hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •