Base | Representation |
---|---|
bin | 1000000001001011001011101… |
… | …0110001000101101110111111 |
3 | 2201222210222010122111001122110 |
4 | 2000102302322301011232333 |
5 | 1042424013222210301311 |
6 | 5320013000240345103 |
7 | 226564052164162104 |
oct | 20022627261055677 |
9 | 2658728118431573 |
10 | 564241577040831 |
11 | 15386a566545908 |
12 | 5334996a615193 |
13 | 1b2ab9a2066a81 |
14 | 9d4961bdbaaab |
15 | 4537341a7d8a6 |
hex | 2012cbac45bbf |
564241577040831 has 16 divisors (see below), whose sum is σ = 759771954298368. Its totient is φ = 372436136532000.
The previous prime is 564241577040821. The next prime is 564241577040857. The reversal of 564241577040831 is 138040775142465.
564241577040831 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 564241577040831 - 27 = 564241577040703 is a prime.
It is a super-2 number, since 2×5642415770408312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (564241577040821) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 377735230 + ... + 379226036.
It is an arithmetic number, because the mean of its divisors is an integer number (47485747143648).
Almost surely, 2564241577040831 is an apocalyptic number.
564241577040831 is a deficient number, since it is larger than the sum of its proper divisors (195530377257537).
564241577040831 is a wasteful number, since it uses less digits than its factorization.
564241577040831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2740022.
The product of its (nonzero) digits is 22579200, while the sum is 57.
The spelling of 564241577040831 in words is "five hundred sixty-four trillion, two hundred forty-one billion, five hundred seventy-seven million, forty thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •