Base | Representation |
---|---|
bin | 11101110110001100011… |
… | …100000100110010001101 |
3 | 21021002010120220112111101 |
4 | 131312030130010302031 |
5 | 232101030211220221 |
6 | 4210124131023101 |
7 | 301120032455401 |
oct | 35661434046215 |
9 | 7232116815441 |
10 | 2051055570061 |
11 | 720936442293 |
12 | 29161243aa91 |
13 | 11b54bbc9a64 |
14 | 713b3475101 |
15 | 3854537dd91 |
hex | 1dd8c704c8d |
2051055570061 has 8 divisors (see below), whose sum is σ = 2059124921784. Its totient is φ = 2042986905600.
The previous prime is 2051055570049. The next prime is 2051055570079. The reversal of 2051055570061 is 1600755501502.
It can be written as a sum of positive squares in 4 ways, for example, as 1120951562500 + 930104007561 = 1058750^2 + 964419^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2051055570061 - 27 = 2051055569933 is a prime.
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 2051055570061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2051055570761) 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, 6284611 + ... + 6602911.
It is an arithmetic number, because the mean of its divisors is an integer number (257390615223).
Almost surely, 22051055570061 is an apocalyptic number.
It is an amenable number.
2051055570061 is a deficient number, since it is larger than the sum of its proper divisors (8069351723).
2051055570061 is a wasteful number, since it uses less digits than its factorization.
2051055570061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343631.
The product of its (nonzero) digits is 52500, while the sum is 37.
The spelling of 2051055570061 in words is "two trillion, fifty-one billion, fifty-five million, five hundred seventy thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •