Base | Representation |
---|---|
bin | 11001100000100111011101… |
… | …00010100000010001110000 |
3 | 21100121202021211220220002111 |
4 | 30300103232202200101300 |
5 | 24323040132334031042 |
6 | 315150134541455104 |
7 | 14546551662230134 |
oct | 1460235642402160 |
9 | 240552254826074 |
10 | 56096274908272 |
11 | 16968329839035 |
12 | 635ba00b71494 |
13 | 253bb188c4a01 |
14 | dbd1078253c4 |
15 | 6742d5cb1517 |
hex | 3304ee8a0470 |
56096274908272 has 80 divisors (see below), whose sum is σ = 114913082592000. Its totient is φ = 26454474588672.
The previous prime is 56096274908237. The next prime is 56096274908309. The reversal of 56096274908272 is 27280947269065.
It is a junction number, because it is equal to n+sod(n) for n = 56096274908198 and 56096274908207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129225604 + ... + 129658972.
It is an arithmetic number, because the mean of its divisors is an integer number (1436413532400).
Almost surely, 256096274908272 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 56096274908272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57456541296000).
56096274908272 is an abundant number, since it is smaller than the sum of its proper divisors (58816807683728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56096274908272 is a wasteful number, since it uses less digits than its factorization.
56096274908272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435278 (or 435272 counting only the distinct ones).
The product of its (nonzero) digits is 182891520, while the sum is 67.
The spelling of 56096274908272 in words is "fifty-six trillion, ninety-six billion, two hundred seventy-four million, nine hundred eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •