Base | Representation |
---|---|
bin | 1101011000011… |
… | …0110001000101 |
3 | 10220121112010111 |
4 | 3112012301011 |
5 | 103332022113 |
6 | 5322553021 |
7 | 1251032131 |
oct | 326066105 |
9 | 126545114 |
10 | 56126533 |
11 | 29755771 |
12 | 16968771 |
13 | b821b88 |
14 | 76503c1 |
15 | 4dda13d |
hex | 3586c45 |
56126533 has 2 divisors, whose sum is σ = 56126534. Its totient is φ = 56126532.
The previous prime is 56126531. The next prime is 56126569. The reversal of 56126533 is 33562165.
It is the 3059-th star number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50452609 + 5673924 = 7103^2 + 2382^2 .
It is a cyclic number.
It is not a de Polignac number, because 56126533 - 21 = 56126531 is a prime.
Together with 56126531, it forms a pair of twin primes.
It is equal to p3345466 and since 56126533 and 3345466 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 56126495 and 56126504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56126531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28063266 + 28063267.
It is an arithmetic number, because the mean of its divisors is an integer number (28063267).
Almost surely, 256126533 is an apocalyptic number.
It is an amenable number.
56126533 is a deficient number, since it is larger than the sum of its proper divisors (1).
56126533 is an equidigital number, since it uses as much as digits as its factorization.
56126533 is an evil number, because the sum of its binary digits is even.
The product of its digits is 16200, while the sum is 31.
The square root of 56126533 is about 7491.7643449324. The cubic root of 56126533 is about 382.8741732750.
Adding to 56126533 its reverse (33562165), we get a palindrome (89688698).
The spelling of 56126533 in words is "fifty-six million, one hundred twenty-six thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •