Base | Representation |
---|---|
bin | 1000011101010110… |
… | …00000000010010001 |
3 | 102201110220211102222 |
4 | 10032223000002101 |
5 | 33300011330112 |
6 | 2030335550425 |
7 | 220350613553 |
oct | 41653000221 |
9 | 12643824388 |
10 | 4541120657 |
11 | 1a20387187 |
12 | a6898b415 |
13 | 574a73458 |
14 | 3111714d3 |
15 | 1b8a12372 |
hex | 10eac0091 |
4541120657 has 2 divisors, whose sum is σ = 4541120658. Its totient is φ = 4541120656.
The previous prime is 4541120629. The next prime is 4541120659. The reversal of 4541120657 is 7560211454.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4460102656 + 81018001 = 66784^2 + 9001^2 .
It is a cyclic number.
It is not a de Polignac number, because 4541120657 - 220 = 4540072081 is a prime.
It is a super-2 number, since 2×45411206572 = 41243553642864223298, which contains 22 as substring.
Together with 4541120659, 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 (4541120659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2270560328 + 2270560329.
It is an arithmetic number, because the mean of its divisors is an integer number (2270560329).
Almost surely, 24541120657 is an apocalyptic number.
It is an amenable number.
4541120657 is a deficient number, since it is larger than the sum of its proper divisors (1).
4541120657 is an equidigital number, since it uses as much as digits as its factorization.
4541120657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33600, while the sum is 35.
The square root of 4541120657 is about 67387.8376044224. The cubic root of 4541120657 is about 1655.9771774152.
The spelling of 4541120657 in words is "four billion, five hundred forty-one million, one hundred twenty thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •