Base | Representation |
---|---|
bin | 1100001110100000… |
… | …01000011101010001 |
3 | 121221110112212101102 |
4 | 12013100020131101 |
5 | 101420403323101 |
6 | 3003203514145 |
7 | 321444050156 |
oct | 60720103521 |
9 | 17843485342 |
10 | 6564120401 |
11 | 28693028a3 |
12 | 1332388955 |
13 | 807c11417 |
14 | 463ad622d |
15 | 28641986b |
hex | 187408751 |
6564120401 has 2 divisors, whose sum is σ = 6564120402. Its totient is φ = 6564120400.
The previous prime is 6564120373. The next prime is 6564120403. The reversal of 6564120401 is 1040214656.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6561162001 + 2958400 = 81001^2 + 1720^2 .
It is a cyclic number.
It is not a de Polignac number, because 6564120401 - 222 = 6559926097 is a prime.
It is a super-3 number, since 3×65641204013 (a number of 30 digits) contains 333 as substring.
Together with 6564120403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (6564120403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3282060200 + 3282060201.
It is an arithmetic number, because the mean of its divisors is an integer number (3282060201).
Almost surely, 26564120401 is an apocalyptic number.
It is an amenable number.
6564120401 is a deficient number, since it is larger than the sum of its proper divisors (1).
6564120401 is an equidigital number, since it uses as much as digits as its factorization.
6564120401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 6564120401 is about 81019.2594448999. The cubic root of 6564120401 is about 1872.3721790606.
The spelling of 6564120401 in words is "six billion, five hundred sixty-four million, one hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •