Base | Representation |
---|---|
bin | 1101011000101… |
… | …1001010010011 |
3 | 10220122102211002 |
4 | 3112023022103 |
5 | 103333111111 |
6 | 5323212215 |
7 | 1251135452 |
oct | 326131223 |
9 | 126572732 |
10 | 56144531 |
11 | 29768243 |
12 | 1697706b |
13 | b82a121 |
14 | 7656b99 |
15 | 4de063b |
hex | 358b293 |
56144531 has 2 divisors, whose sum is σ = 56144532. Its totient is φ = 56144530.
The previous prime is 56144527. The next prime is 56144567. The reversal of 56144531 is 13544165.
It is a happy number.
56144531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56144531 - 22 = 56144527 is a prime.
It is a super-2 number, since 2×561445312 = 6304416722419922, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 56144494 and 56144503.
It is not a weakly prime, because it can be changed into another prime (56144521) 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, 28072265 + 28072266.
It is an arithmetic number, because the mean of its divisors is an integer number (28072266).
Almost surely, 256144531 is an apocalyptic number.
56144531 is a deficient number, since it is larger than the sum of its proper divisors (1).
56144531 is an equidigital number, since it uses as much as digits as its factorization.
56144531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7200, while the sum is 29.
The square root of 56144531 is about 7492.9654343257. The cubic root of 56144531 is about 382.9150941049.
Adding to 56144531 its reverse (13544165), we get a palindrome (69688696).
The spelling of 56144531 in words is "fifty-six million, one hundred forty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •