Base | Representation |
---|---|
bin | 11001111110011010010011… |
… | …11010000000100001101011 |
3 | 21111020121201201010112222020 |
4 | 30333031021322000201223 |
5 | 24441323240030402104 |
6 | 321252323105555523 |
7 | 15013533045105450 |
oct | 1477151172004153 |
9 | 244217651115866 |
10 | 57120010012779 |
11 | 1722250759a27a |
12 | 64a62a7945ba3 |
13 | 25b451733028c |
14 | 10168a2231827 |
15 | 690c511412d9 |
hex | 33f349e8086b |
57120010012779 has 64 divisors (see below), whose sum is σ = 92228596088832. Its totient is φ = 30697153344000.
The previous prime is 57120010012771. The next prime is 57120010012783. The reversal of 57120010012779 is 97721001002175.
57120010012779 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 57120010012779 - 23 = 57120010012771 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 57120010012779.
It is not an unprimeable number, because it can be changed into a prime (57120010012771) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 4929657624 + ... + 4929669210.
It is an arithmetic number, because the mean of its divisors is an integer number (1441071813888).
Almost surely, 257120010012779 is an apocalyptic number.
57120010012779 is a deficient number, since it is larger than the sum of its proper divisors (35108586076053).
57120010012779 is a wasteful number, since it uses less digits than its factorization.
57120010012779 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20696.
The product of its (nonzero) digits is 61740, while the sum is 42.
The spelling of 57120010012779 in words is "fifty-seven trillion, one hundred twenty billion, ten million, twelve thousand, seven hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •