Base | Representation |
---|---|
bin | 100001100111100… |
… | …010111110011001 |
3 | 1110022021221010111 |
4 | 201213202332121 |
5 | 2123341440001 |
6 | 131544444321 |
7 | 16656022414 |
oct | 4147427631 |
9 | 1408257114 |
10 | 564015001 |
11 | 26a40a900 |
12 | 138a796a1 |
13 | 8cb096b4 |
14 | 54c9ab7b |
15 | 347b0851 |
hex | 219e2f99 |
564015001 has 27 divisors (see below), whose sum is σ = 663789567. Its totient is φ = 478779840.
The previous prime is 564014989. The next prime is 564015017. The reversal of 564015001 is 100510465.
The square root of 564015001 is 23749.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 439112025 + 124902976 = 20955^2 + 11176^2 .
It is not a de Polignac number, because 564015001 - 27 = 564014873 is a prime.
It is a super-2 number, since 2×5640150012 = 636225842706060002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (564015041) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4441000 + ... + 4441126.
Almost surely, 2564015001 is an apocalyptic number.
564015001 is the 23749-th square number.
564015001 is the 11875-th centered octagonal number.
It is an amenable number.
564015001 is a deficient number, since it is larger than the sum of its proper divisors (99774566).
564015001 is a wasteful number, since it uses less digits than its factorization.
564015001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 310 (or 155 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
The cubic root of 564015001 is about 826.2222475903. Note that the first 4 decimals are identical.
Adding to 564015001 its reverse (100510465), we get a palindrome (664525466).
The spelling of 564015001 in words is "five hundred sixty-four million, fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •