Base | Representation |
---|---|
bin | 11111101100000… |
… | …111000111110001 |
3 | 1101001101222120110 |
4 | 133230013013301 |
5 | 2042101012301 |
6 | 124431131533 |
7 | 16114003665 |
oct | 3754070761 |
9 | 1331358513 |
10 | 531657201 |
11 | 253119a19 |
12 | 12a073ba9 |
13 | 861ba47a |
14 | 508768a5 |
15 | 31a1d0d6 |
hex | 1fb071f1 |
531657201 has 32 divisors (see below), whose sum is σ = 770774400. Its totient is φ = 324725760.
The previous prime is 531657169. The next prime is 531657211. The reversal of 531657201 is 102756135.
It is not a de Polignac number, because 531657201 - 25 = 531657169 is a prime.
It is a super-3 number, since 3×5316572013 (a number of 27 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (531657211) 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 31 ways as a sum of consecutive naturals, for example, 327171 + ... + 328791.
It is an arithmetic number, because the mean of its divisors is an integer number (24086700).
Almost surely, 2531657201 is an apocalyptic number.
531657201 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
531657201 is a deficient number, since it is larger than the sum of its proper divisors (239117199).
531657201 is a wasteful number, since it uses less digits than its factorization.
531657201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1809.
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 531657201 is about 23057.6928811189. The cubic root of 531657201 is about 810.1098265957.
The spelling of 531657201 in words is "five hundred thirty-one million, six hundred fifty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •