Base | Representation |
---|---|
bin | 1001111011011100… |
… | …10000001110000011 |
3 | 111202111021120210200 |
4 | 10331232100032003 |
5 | 41404102040111 |
6 | 2240535100243 |
7 | 246044344464 |
oct | 47556201603 |
9 | 14674246720 |
10 | 5330502531 |
11 | 2295a254a2 |
12 | 1049211683 |
13 | 66c479313 |
14 | 387d34d6b |
15 | 212e8d256 |
hex | 13db90383 |
5330502531 has 12 divisors (see below), whose sum is σ = 7704339552. Its totient is φ = 3551487696.
The previous prime is 5330502481. The next prime is 5330502533. The reversal of 5330502531 is 1352050335.
5330502531 is a `hidden beast` number, since 53 + 30 + 50 + 2 + 531 = 666.
It is not a de Polignac number, because 5330502531 - 26 = 5330502467 is a prime.
It is a super-2 number, since 2×53305025312 = 56828514465994811922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5330502495 and 5330502504.
It is not an unprimeable number, because it can be changed into a prime (5330502533) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 166171 + ... + 195636.
It is an arithmetic number, because the mean of its divisors is an integer number (642028296).
Almost surely, 25330502531 is an apocalyptic number.
5330502531 is a deficient number, since it is larger than the sum of its proper divisors (2373837021).
5330502531 is a wasteful number, since it uses less digits than its factorization.
5330502531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 363450 (or 363447 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 27.
The square root of 5330502531 is about 73010.2905829034. The cubic root of 5330502531 is about 1746.8517580637.
Adding to 5330502531 its reverse (1352050335), we get a palindrome (6682552866).
The spelling of 5330502531 in words is "five billion, three hundred thirty million, five hundred two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •