Base | Representation |
---|---|
bin | 11001110010001101001001… |
… | …00001111110010110010010 |
3 | 21102202112012221200121120210 |
4 | 30321012210201332112102 |
5 | 24412440334123102200 |
6 | 320331523520344550 |
7 | 14641325211562131 |
oct | 1471064441762622 |
9 | 242675187617523 |
10 | 56700623644050 |
11 | 17080665957141 |
12 | 6438b64175156 |
13 | 2583acc4a6549 |
14 | 100047947b918 |
15 | 684da77dd650 |
hex | 3391a487e592 |
56700623644050 has 24 divisors (see below), whose sum is σ = 140617546637616. Its totient is φ = 15120166305040.
The previous prime is 56700623644043. The next prime is 56700623644051. The reversal of 56700623644050 is 5044632600765.
It is a super-3 number, since 3×567006236440503 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (56700623644051) 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, 189002078664 + ... + 189002078963.
It is an arithmetic number, because the mean of its divisors is an integer number (5859064443234).
Almost surely, 256700623644050 is an apocalyptic number.
56700623644050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56700623644050 is an abundant number, since it is smaller than the sum of its proper divisors (83916922993566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56700623644050 is a wasteful number, since it uses less digits than its factorization.
56700623644050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378004157642 (or 378004157637 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 48.
The spelling of 56700623644050 in words is "fifty-six trillion, seven hundred billion, six hundred twenty-three million, six hundred forty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •