Base | Representation |
---|---|
bin | 11001110001101110010001… |
… | …01101011111111000111011 |
3 | 21102200221102221220200000121 |
4 | 30320313020231133320323 |
5 | 24412202413444304421 |
6 | 320320143214314111 |
7 | 14640200422533340 |
oct | 1470671055377073 |
9 | 242627387820017 |
10 | 56684050775611 |
11 | 17074630a04856 |
12 | 64358b9ab8937 |
13 | 258238ab33c0c |
14 | ddd7463c67c7 |
15 | 684737888d41 |
hex | 338dc8b5fe3b |
56684050775611 has 8 divisors (see below), whose sum is σ = 65376100502240. Its totient is φ = 48140583095808.
The previous prime is 56684050775591. The next prime is 56684050775621. The reversal of 56684050775611 is 11657705048665.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 56684050775611 - 211 = 56684050773563 is a prime.
It is a super-2 number, since 2×566840507756112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 56684050775611.
It is not an unprimeable number, because it can be changed into a prime (56684050775621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37145510886 + ... + 37145512411.
It is an arithmetic number, because the mean of its divisors is an integer number (8172012562780).
Almost surely, 256684050775611 is an apocalyptic number.
56684050775611 is a deficient number, since it is larger than the sum of its proper divisors (8692049726629).
56684050775611 is a wasteful number, since it uses less digits than its factorization.
56684050775611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74291023413.
The product of its (nonzero) digits is 42336000, while the sum is 61.
The spelling of 56684050775611 in words is "fifty-six trillion, six hundred eighty-four billion, fifty million, seven hundred seventy-five thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •