Base | Representation |
---|---|
bin | 11111101100010… |
… | …010111100000001 |
3 | 1101001111102222001 |
4 | 133230102330001 |
5 | 2042104034401 |
6 | 124432144001 |
7 | 16114265050 |
oct | 3754227401 |
9 | 1331442861 |
10 | 531705601 |
11 | 253152319 |
12 | 12a098001 |
13 | 862064cb |
14 | 5088a397 |
15 | 31a2c601 |
hex | 1fb12f01 |
531705601 has 8 divisors (see below), whose sum is σ = 608200704. Its totient is φ = 455344800.
The previous prime is 531705571. The next prime is 531705611. The reversal of 531705601 is 106507135.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 531705601 - 25 = 531705569 is a prime.
It is a super-2 number, since 2×5317056012 = 565421692269542402, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 531705601.
It is not an unprimeable number, because it can be changed into a prime (531705611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24940 + ... + 41053.
It is an arithmetic number, because the mean of its divisors is an integer number (76025088).
Almost surely, 2531705601 is an apocalyptic number.
It is an amenable number.
531705601 is a deficient number, since it is larger than the sum of its proper divisors (76495103).
531705601 is a wasteful number, since it uses less digits than its factorization.
531705601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67151.
The product of its (nonzero) digits is 3150, while the sum is 28.
The square root of 531705601 is about 23058.7423984917. The cubic root of 531705601 is about 810.1344089304.
The spelling of 531705601 in words is "five hundred thirty-one million, seven hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •