Base | Representation |
---|---|
bin | 11001110010001101001010… |
… | …00110101000011010100111 |
3 | 21102202112020121202211022221 |
4 | 30321012211012220122213 |
5 | 24412440344103103133 |
6 | 320331524502333211 |
7 | 14641325356344136 |
oct | 1471064506503247 |
9 | 242675217684287 |
10 | 56700633253543 |
11 | 1708067031a974 |
12 | 6438b6742a207 |
13 | 2583b0148c436 |
14 | 100047a85d91d |
15 | 684da858aa2d |
hex | 3391a51a86a7 |
56700633253543 has 4 divisors (see below), whose sum is σ = 56715426013248. Its totient is φ = 56685840493840.
The previous prime is 56700633253519. The next prime is 56700633253553. The reversal of 56700633253543 is 34535233600765.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 56700633253543 - 29 = 56700633253031 is a prime.
It is a super-4 number, since 4×567006332535434 (a number of 56 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56700633253553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7396374103 + ... + 7396381768.
It is an arithmetic number, because the mean of its divisors is an integer number (14178856503312).
Almost surely, 256700633253543 is an apocalyptic number.
56700633253543 is a deficient number, since it is larger than the sum of its proper divisors (14792759705).
56700633253543 is a wasteful number, since it uses less digits than its factorization.
56700633253543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14792759704.
The product of its (nonzero) digits is 20412000, while the sum is 52.
The spelling of 56700633253543 in words is "fifty-six trillion, seven hundred billion, six hundred thirty-three million, two hundred fifty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •