Base | Representation |
---|---|
bin | 110100100010010111… |
… | …111011100001010000 |
3 | 12101121101202121012101 |
4 | 310202113323201100 |
5 | 1411012241221141 |
6 | 41525345210144 |
7 | 4034631624430 |
oct | 644227734120 |
9 | 171541677171 |
10 | 56411273296 |
11 | 21a18769624 |
12 | ab24030954 |
13 | 54200c6371 |
14 | 2a31dda2c0 |
15 | 170266b531 |
hex | d225fb850 |
56411273296 has 160 divisors (see below), whose sum is σ = 136954091520. Its totient is φ = 21968755200.
The previous prime is 56411273287. The next prime is 56411273363. The reversal of 56411273296 is 69237211465.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5585211 + ... + 5595301.
It is an arithmetic number, because the mean of its divisors is an integer number (855963072).
Almost surely, 256411273296 is an apocalyptic number.
56411273296 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56411273296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68477045760).
56411273296 is an abundant number, since it is smaller than the sum of its proper divisors (80542818224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56411273296 is a wasteful number, since it uses less digits than its factorization.
56411273296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10233 (or 10227 counting only the distinct ones).
The product of its digits is 544320, while the sum is 46.
The spelling of 56411273296 in words is "fifty-six billion, four hundred eleven million, two hundred seventy-three thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •