Base | Representation |
---|---|
bin | 100001110000101… |
… | …010110100011111 |
3 | 1110110210102112222 |
4 | 201300222310133 |
5 | 2130000001211 |
6 | 132112015555 |
7 | 20015242463 |
oct | 4160526437 |
9 | 1413712488 |
10 | 566406431 |
11 | 2707a3598 |
12 | 1398315bb |
13 | 90466046 |
14 | 553204a3 |
15 | 34ad41db |
hex | 21c2ad1f |
566406431 has 8 divisors (see below), whose sum is σ = 590058000. Its totient is φ = 543223360.
The previous prime is 566406367. The next prime is 566406433. The reversal of 566406431 is 134604665.
566406431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 566406431 - 26 = 566406367 is a prime.
It is a super-2 number, since 2×5664064312 = 641632490156315522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 566406391 and 566406400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (566406433) 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, 114656 + ... + 119493.
It is an arithmetic number, because the mean of its divisors is an integer number (73757250).
Almost surely, 2566406431 is an apocalyptic number.
566406431 is a deficient number, since it is larger than the sum of its proper divisors (23651569).
566406431 is a wasteful number, since it uses less digits than its factorization.
566406431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234249.
The product of its (nonzero) digits is 51840, while the sum is 35.
The square root of 566406431 is about 23799.2947584587. The cubic root of 566406431 is about 827.3883316363.
The spelling of 566406431 in words is "five hundred sixty-six million, four hundred six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •