Base | Representation |
---|---|
bin | 1101011100001… |
… | …1110100100100 |
3 | 10221002020011200 |
4 | 3113003310210 |
5 | 103413022422 |
6 | 5332202500 |
7 | 1253123205 |
oct | 327036444 |
9 | 127066150 |
10 | 56376612 |
11 | 29906646 |
12 | 16a69430 |
13 | b8ab956 |
14 | 76b75ac |
15 | 4e392ac |
hex | 35c3d24 |
56376612 has 72 divisors (see below), whose sum is σ = 147987840. Its totient is φ = 18083520.
The previous prime is 56376589. The next prime is 56376637. The reversal of 56376612 is 21667365.
56376612 is a `hidden beast` number, since 5 + 6 + 37 + 6 + 612 = 666.
56376612 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 (36).
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 23 ways as a sum of consecutive naturals, for example, 122062 + ... + 122522.
Almost surely, 256376612 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56376612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73993920).
56376612 is an abundant number, since it is smaller than the sum of its proper divisors (91611228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56376612 is a wasteful number, since it uses less digits than its factorization.
56376612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593 (or 588 counting only the distinct ones).
The product of its digits is 45360, while the sum is 36.
The square root of 56376612 is about 7508.4360555311. The cubic root of 56376612 is about 383.4419792021.
The spelling of 56376612 in words is "fifty-six million, three hundred seventy-six thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •