Base | Representation |
---|---|
bin | 1101011000000… |
… | …0101100010101 |
3 | 10220120021000000 |
4 | 3112000230111 |
5 | 103330223103 |
6 | 5322241513 |
7 | 1250566446 |
oct | 326005425 |
9 | 126507000 |
10 | 56101653 |
11 | 29739003 |
12 | 16956299 |
13 | b81375a |
14 | 76452cd |
15 | 4dd2aa3 |
hex | 3580b15 |
56101653 has 28 divisors (see below), whose sum is σ = 86211468. Its totient is φ = 36469440.
The previous prime is 56101603. The next prime is 56101663. The reversal of 56101653 is 35610165.
It is a happy number.
56101653 is a `hidden beast` number, since 5 + 6 + 1 + 0 + 1 + 653 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 16184529 + 39917124 = 4023^2 + 6318^2 .
It is not a de Polignac number, because 56101653 - 29 = 56101141 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56101603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 28951 + ... + 30827.
It is an arithmetic number, because the mean of its divisors is an integer number (3078981).
Almost surely, 256101653 is an apocalyptic number.
It is an amenable number.
56101653 is a deficient number, since it is larger than the sum of its proper divisors (30109815).
56101653 is an equidigital number, since it uses as much as digits as its factorization.
56101653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1936 (or 1921 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 56101653 is about 7490.1036708446. The cubic root of 56101653 is about 382.8175909016.
The spelling of 56101653 in words is "fifty-six million, one hundred one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •