Base | Representation |
---|---|
bin | 1010100000111110… |
… | …01111101110110101 |
3 | 112120102200202102011 |
4 | 11100133033232311 |
5 | 43030201213402 |
6 | 2332103044221 |
7 | 256616363005 |
oct | 52037175665 |
9 | 15512622364 |
10 | 5645335477 |
11 | 2437710111 |
12 | 1116740671 |
13 | 6bc76b6c2 |
14 | 3b7a8a005 |
15 | 23092bed7 |
hex | 1507cfbb5 |
5645335477 has 2 divisors, whose sum is σ = 5645335478. Its totient is φ = 5645335476.
The previous prime is 5645335459. The next prime is 5645335517. The reversal of 5645335477 is 7745335465.
5645335477 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4694168196 + 951167281 = 68514^2 + 30841^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5645335477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5645335477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5645335427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2822667738 + 2822667739.
It is an arithmetic number, because the mean of its divisors is an integer number (2822667739).
Almost surely, 25645335477 is an apocalyptic number.
It is an amenable number.
5645335477 is a deficient number, since it is larger than the sum of its proper divisors (1).
5645335477 is an equidigital number, since it uses as much as digits as its factorization.
5645335477 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5292000, while the sum is 49.
The square root of 5645335477 is about 75135.4475397598. The cubic root of 5645335477 is about 1780.5872191458.
The spelling of 5645335477 in words is "five billion, six hundred forty-five million, three hundred thirty-five thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •