Base | Representation |
---|---|
bin | 1101011000101… |
… | …1011100100001 |
3 | 10220122111102021 |
4 | 3112023130201 |
5 | 103333130242 |
6 | 5323221441 |
7 | 1251142036 |
oct | 326133441 |
9 | 126574367 |
10 | 56145697 |
11 | 29769103 |
12 | 16977881 |
13 | b82a80a |
14 | 765738d |
15 | 4de0b67 |
hex | 358b721 |
56145697 has 2 divisors, whose sum is σ = 56145698. Its totient is φ = 56145696.
The previous prime is 56145689. The next prime is 56145701. The reversal of 56145697 is 79654165.
56145697 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37405456 + 18740241 = 6116^2 + 4329^2 .
It is a cyclic number.
It is not a de Polignac number, because 56145697 - 23 = 56145689 is a prime.
It is not a weakly prime, because it can be changed into another prime (56145647) 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, 28072848 + 28072849.
It is an arithmetic number, because the mean of its divisors is an integer number (28072849).
Almost surely, 256145697 is an apocalyptic number.
It is an amenable number.
56145697 is a deficient number, since it is larger than the sum of its proper divisors (1).
56145697 is an equidigital number, since it uses as much as digits as its factorization.
56145697 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 226800, while the sum is 43.
The square root of 56145697 is about 7493.0432402329. The cubic root of 56145697 is about 382.9177448582.
It can be divided in two parts, 5614 and 5697, that added together give a palindrome (11311).
The spelling of 56145697 in words is "fifty-six million, one hundred forty-five thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •