Base | Representation |
---|---|
bin | 11001011111011100101000… |
… | …01110111000101001100000 |
3 | 21100110220121100100201022021 |
4 | 30233232110032320221200 |
5 | 24321410400402010422 |
6 | 315115452535351224 |
7 | 14543630353461022 |
oct | 1457562416705140 |
9 | 240426540321267 |
10 | 56056105110112 |
11 | 16952295a56138 |
12 | 6354070222514 |
13 | 25380b6600c83 |
14 | dbb1b6898012 |
15 | 673234438dc7 |
hex | 32fb943b8a60 |
56056105110112 has 48 divisors (see below), whose sum is σ = 114467220176400. Its totient is φ = 26990165260800.
The previous prime is 56056105110041. The next prime is 56056105110121. The reversal of 56056105110112 is 21101150165065.
56056105110112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79338639 + ... + 80042062.
It is an arithmetic number, because the mean of its divisors is an integer number (2384733753675).
Almost surely, 256056105110112 is an apocalyptic number.
It is an amenable number.
56056105110112 is an abundant number, since it is smaller than the sum of its proper divisors (58411115066288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56056105110112 is a wasteful number, since it uses less digits than its factorization.
56056105110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159381119 (or 159381111 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 34.
Adding to 56056105110112 its reverse (21101150165065), we get a palindrome (77157255275177).
The spelling of 56056105110112 in words is "fifty-six trillion, fifty-six billion, one hundred five million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •