Base | Representation |
---|---|
bin | 11001110100000110000110… |
… | …10011011111101110100000 |
3 | 21102222201211210021110022120 |
4 | 30322003003103133232200 |
5 | 24420021333444423434 |
6 | 320421423523304240 |
7 | 14646114414413031 |
oct | 1472030323375640 |
9 | 242881753243276 |
10 | 56765564451744 |
11 | 170a6160292145 |
12 | 644966881b080 |
13 | 2589c7b738b85 |
14 | 100367a1c4a88 |
15 | 686908ba4349 |
hex | 33a0c34dfba0 |
56765564451744 has 48 divisors (see below), whose sum is σ = 149082686948160. Its totient is φ = 18912574784000.
The previous prime is 56765564451709. The next prime is 56765564451763. The reversal of 56765564451744 is 44715446556765.
56765564451744 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
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, 144803757 + ... + 145195244.
It is an arithmetic number, because the mean of its divisors is an integer number (3105889311420).
Almost surely, 256765564451744 is an apocalyptic number.
It is an amenable number.
56765564451744 is an abundant number, since it is smaller than the sum of its proper divisors (92317122496416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56765564451744 is a wasteful number, since it uses less digits than its factorization.
56765564451744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290001053 (or 290001045 counting only the distinct ones).
The product of its digits is 1693440000, while the sum is 69.
The spelling of 56765564451744 in words is "fifty-six trillion, seven hundred sixty-five billion, five hundred sixty-four million, four hundred fifty-one thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •