Base | Representation |
---|---|
bin | 110100100010000101… |
… | …000011011101101100 |
3 | 12101121001110012112212 |
4 | 310202011003131230 |
5 | 1411010004400400 |
6 | 41525051145552 |
7 | 4034541565256 |
oct | 644205033554 |
9 | 171531405485 |
10 | 56406325100 |
11 | 21a15999a04 |
12 | ab224452b8 |
13 | 541c083038 |
14 | 2a314accd6 |
15 | 1701ee0335 |
hex | d2214376c |
56406325100 has 72 divisors (see below), whose sum is σ = 123500897520. Its totient is φ = 22360504320.
The previous prime is 56406325099. The next prime is 56406325109. The reversal of 56406325100 is 152360465.
It is a super-2 number, since 2×564063251002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (56406325109) 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, 8573012 + ... + 8579588.
Almost surely, 256406325100 is an apocalyptic number.
56406325100 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 56406325100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61750448760).
56406325100 is an abundant number, since it is smaller than the sum of its proper divisors (67094572420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56406325100 is a wasteful number, since it uses less digits than its factorization.
56406325100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7347 (or 7340 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 56406325100 its reverse (152360465), we get a palindrome (56558685565).
The spelling of 56406325100 in words is "fifty-six billion, four hundred six million, three hundred twenty-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •