Base | Representation |
---|---|
bin | 11001110011101111000000… |
… | …00100001010000001100011 |
3 | 21102221112211110000002022222 |
4 | 30321313200010022001203 |
5 | 24414320433442134232 |
6 | 320412013121221255 |
7 | 14645165156036033 |
oct | 1471674004120143 |
9 | 242845743002288 |
10 | 56753162068067 |
11 | 170a0976487783 |
12 | 644718719182b |
13 | 2588a53109aca |
14 | 1002c20d818c3 |
15 | 68642ee4dd12 |
hex | 339de010a063 |
56753162068067 has 4 divisors (see below), whose sum is σ = 56809186908240. Its totient is φ = 56697137227896.
The previous prime is 56753162068051. The next prime is 56753162068103. The reversal of 56753162068067 is 76086026135765.
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 56753162068067 - 24 = 56753162068051 is a prime.
It is a super-2 number, since 2×567531620680672 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56753162062067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28012418567 + ... + 28012420592.
It is an arithmetic number, because the mean of its divisors is an integer number (14202296727060).
Almost surely, 256753162068067 is an apocalyptic number.
56753162068067 is a deficient number, since it is larger than the sum of its proper divisors (56024840173).
56753162068067 is a wasteful number, since it uses less digits than its factorization.
56753162068067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56024840172.
The product of its (nonzero) digits is 76204800, while the sum is 62.
The spelling of 56753162068067 in words is "fifty-six trillion, seven hundred fifty-three billion, one hundred sixty-two million, sixty-eight thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •