Base | Representation |
---|---|
bin | 1001110010001001… |
… | …10111001101100011 |
3 | 111120001120211212220 |
4 | 10321010313031203 |
5 | 41224122341311 |
6 | 2225112122123 |
7 | 244106611260 |
oct | 47104671543 |
9 | 14501524786 |
10 | 5252543331 |
11 | 2255a18602 |
12 | 1027096343 |
13 | 659281b09 |
14 | 37b840267 |
15 | 20b1de206 |
hex | 139137363 |
5252543331 has 16 divisors (see below), whose sum is σ = 8425132800. Its totient is φ = 2843481888.
The previous prime is 5252543291. The next prime is 5252543383. The reversal of 5252543331 is 1333452525.
It is not a de Polignac number, because 5252543331 - 215 = 5252510563 is a prime.
It is a super-2 number, since 2×52525433312 = 55178422888065151122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5252543292 and 5252543301.
It is not an unprimeable number, because it can be changed into a prime (5252543731) 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 in 15 ways as a sum of consecutive naturals, for example, 6581736 + ... + 6582533.
It is an arithmetic number, because the mean of its divisors is an integer number (526570800).
Almost surely, 25252543331 is an apocalyptic number.
5252543331 is a deficient number, since it is larger than the sum of its proper divisors (3172589469).
5252543331 is a wasteful number, since it uses less digits than its factorization.
5252543331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13164298.
The product of its digits is 54000, while the sum is 33.
The square root of 5252543331 is about 72474.4322571760. The cubic root of 5252543331 is about 1738.2939338433.
Adding to 5252543331 its reverse (1333452525), we get a palindrome (6585995856).
The spelling of 5252543331 in words is "five billion, two hundred fifty-two million, five hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •