Base | Representation |
---|---|
bin | 10000011011101110110… |
… | …11110101001001011101 |
3 | 1222222110001020120022112 |
4 | 20031313123311021131 |
5 | 33222342443000221 |
6 | 1111221043123405 |
7 | 55536263026505 |
oct | 10156733651135 |
9 | 1888401216275 |
10 | 564644500061 |
11 | 1a8512111164 |
12 | 91522373565 |
13 | 41326ba6145 |
14 | 1d486878a05 |
15 | ea4aeb915b |
hex | 83776f525d |
564644500061 has 2 divisors, whose sum is σ = 564644500062. Its totient is φ = 564644500060.
The previous prime is 564644499997. The next prime is 564644500067. The reversal of 564644500061 is 160005446465.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 493374188836 + 71270311225 = 702406^2 + 266965^2 .
It is a cyclic number.
It is not a de Polignac number, because 564644500061 - 26 = 564644499997 is a prime.
It is a super-2 number, since 2×5646445000612 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 564644499991 and 564644500018.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (564644500067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282322250030 + 282322250031.
It is an arithmetic number, because the mean of its divisors is an integer number (282322250031).
Almost surely, 2564644500061 is an apocalyptic number.
It is an amenable number.
564644500061 is a deficient number, since it is larger than the sum of its proper divisors (1).
564644500061 is an equidigital number, since it uses as much as digits as its factorization.
564644500061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 564644500061 in words is "five hundred sixty-four billion, six hundred forty-four million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •