Base | Representation |
---|---|
bin | 1001110000000100… |
… | …00110000100010011 |
3 | 111111211122121120001 |
4 | 10320002012010103 |
5 | 41210132244111 |
6 | 2223245030431 |
7 | 243505052560 |
oct | 47002060423 |
9 | 14454577501 |
10 | 5235040531 |
11 | 2247053486 |
12 | 1021255417 |
13 | 655764226 |
14 | 3793a5867 |
15 | 2098d31c1 |
hex | 138086113 |
5235040531 has 32 divisors (see below), whose sum is σ = 6544512000. Its totient is φ = 4085811072.
The previous prime is 5235040513. The next prime is 5235040583. The reversal of 5235040531 is 1350405325.
It is not a de Polignac number, because 5235040531 - 227 = 5100822803 is a prime.
It is a super-2 number, since 2×52350405312 = 54811298722425523922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5235040531.
It is not an unprimeable number, because it can be changed into a prime (5235040331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 880290 + ... + 886216.
It is an arithmetic number, because the mean of its divisors is an integer number (204516000).
Almost surely, 25235040531 is an apocalyptic number.
5235040531 is a deficient number, since it is larger than the sum of its proper divisors (1309471469).
5235040531 is a wasteful number, since it uses less digits than its factorization.
5235040531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6211.
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 5235040531 is about 72353.5799459847. The cubic root of 5235040531 is about 1736.3609738496.
Adding to 5235040531 its reverse (1350405325), we get a palindrome (6585445856).
The spelling of 5235040531 in words is "five billion, two hundred thirty-five million, forty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •