Base | Representation |
---|---|
bin | 1101011100111… |
… | …1101000101000 |
3 | 10221011200112211 |
4 | 3113033220220 |
5 | 103421100000 |
6 | 5333214504 |
7 | 1253414242 |
oct | 327175050 |
9 | 127150484 |
10 | 56425000 |
11 | 29939a35 |
12 | 16a91434 |
13 | b8c7998 |
14 | 76cb092 |
15 | 4e487ba |
hex | 35cfa28 |
56425000 has 96 divisors (see below), whose sum is σ = 138038040. Its totient is φ = 21600000.
The previous prime is 56424983. The next prime is 56425001. The reversal of 56425000 is 52465.
It can be written as a sum of positive squares in 12 ways, for example, as 30272004 + 26152996 = 5502^2 + 5114^2 .
It is not an unprimeable number, because it can be changed into a prime (56425001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 924970 + ... + 925030.
Almost surely, 256425000 is an apocalyptic number.
56425000 is a gapful number since it is divisible by the number (50) 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 56425000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69019020).
56425000 is an abundant number, since it is smaller than the sum of its proper divisors (81613040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56425000 is an equidigital number, since it uses as much as digits as its factorization.
56425000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129 (or 105 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 56425000 is about 7511.6576066804. The cubic root of 56425000 is about 383.5516504770.
Adding to 56425000 its reverse (52465), we get a palindrome (56477465).
The spelling of 56425000 in words is "fifty-six million, four hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.225 sec. • engine limits •