Base | Representation |
---|---|
bin | 1101011000011… |
… | …0110001000111 |
3 | 10220121112010120 |
4 | 3112012301013 |
5 | 103332022120 |
6 | 5322553023 |
7 | 1251032133 |
oct | 326066107 |
9 | 126545116 |
10 | 56126535 |
11 | 29755773 |
12 | 16968773 |
13 | b821b8a |
14 | 76503c3 |
15 | 4dda140 |
hex | 3586c47 |
56126535 has 16 divisors (see below), whose sum is σ = 90599904. Its totient is φ = 29668352.
The previous prime is 56126533. The next prime is 56126569. The reversal of 56126535 is 53562165.
56126535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 56126535 - 21 = 56126533 is a prime.
It is a super-3 number, since 3×561265353 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 56126496 and 56126505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56126531) 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 in 15 ways as a sum of consecutive naturals, for example, 14862 + ... + 18251.
It is an arithmetic number, because the mean of its divisors is an integer number (5662494).
Almost surely, 256126535 is an apocalyptic number.
56126535 is a deficient number, since it is larger than the sum of its proper divisors (34473369).
56126535 is a wasteful number, since it uses less digits than its factorization.
56126535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33234.
The product of its digits is 27000, while the sum is 33.
The square root of 56126535 is about 7491.7644784123. The cubic root of 56126535 is about 382.8741778227.
The spelling of 56126535 in words is "fifty-six million, one hundred twenty-six thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •