Base | Representation |
---|---|
bin | 1101011000101… |
… | …1011011100000 |
3 | 10220122111022212 |
4 | 3112023123200 |
5 | 103333130012 |
6 | 5323221252 |
7 | 1251141614 |
oct | 326133340 |
9 | 126574285 |
10 | 56145632 |
11 | 29769054 |
12 | 16977828 |
13 | b82a78a |
14 | 7657344 |
15 | 4de0b22 |
hex | 358b6e0 |
56145632 has 24 divisors (see below), whose sum is σ = 111522096. Its totient is φ = 27822592.
The previous prime is 56145629. The next prime is 56145643. The reversal of 56145632 is 23654165.
56145632 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4148 + ... + 11379.
It is an arithmetic number, because the mean of its divisors is an integer number (4646754).
Almost surely, 256145632 is an apocalyptic number.
It is an amenable number.
56145632 is a deficient number, since it is larger than the sum of its proper divisors (55376464).
56145632 is a wasteful number, since it uses less digits than its factorization.
56145632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15650 (or 15642 counting only the distinct ones).
The product of its digits is 21600, while the sum is 32.
The square root of 56145632 is about 7493.0389028751. The cubic root of 56145632 is about 382.9175970899.
Adding to 56145632 its reverse (23654165), we get a palindrome (79799797).
It can be divided in two parts, 561 and 45632, that multiplied together give a palindrome (25599552).
The spelling of 56145632 in words is "fifty-six million, one hundred forty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •