Base | Representation |
---|---|
bin | 110100010111111101… |
… | …000101100010000000 |
3 | 12101011012211101021111 |
4 | 310113331011202000 |
5 | 1410133013324011 |
6 | 41500142333104 |
7 | 4030410026200 |
oct | 642775054200 |
9 | 171135741244 |
10 | 56236464256 |
11 | 21939021a45 |
12 | aa9558a194 |
13 | 53c2b1c16b |
14 | 2a16ad4400 |
15 | 16e213b121 |
hex | d17f45880 |
56236464256 has 96 divisors (see below), whose sum is σ = 130902210000. Its totient is φ = 23994561024.
The previous prime is 56236464227. The next prime is 56236464259. The reversal of 56236464256 is 65246463265.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is not an unprimeable number, because it can be changed into a prime (56236464259) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1403995 + ... + 1443493.
Almost surely, 256236464256 is an apocalyptic number.
56236464256 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 56236464256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65451105000).
56236464256 is an abundant number, since it is smaller than the sum of its proper divisors (74665745744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56236464256 is a wasteful number, since it uses less digits than its factorization.
56236464256 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39754 (or 39735 counting only the distinct ones).
The product of its digits is 6220800, while the sum is 49.
Subtracting 56236464256 from its reverse (65246463265), we obtain a palindrome (9009999009).
The spelling of 56236464256 in words is "fifty-six billion, two hundred thirty-six million, four hundred sixty-four thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •