Base | Representation |
---|---|
bin | 101001111110111111000… |
… | …0101011111001010011110 |
3 | 202102122001002111202221210 |
4 | 1103331332011133022132 |
5 | 1224014441122233420 |
6 | 20134452541205250 |
7 | 1133613222345462 |
oct | 123757605371236 |
9 | 22378032452853 |
10 | 5770256446110 |
11 | 1925174373a62 |
12 | 792393260826 |
13 | 32b195b372c0 |
14 | 15d3d377a4a2 |
15 | a016e6939e0 |
hex | 53f7e15f29e |
5770256446110 has 128 divisors (see below), whose sum is σ = 15707263703040. Its totient is φ = 1344892032000.
The previous prime is 5770256446093. The next prime is 5770256446111. The reversal of 5770256446110 is 116446520775.
It is a self number, because there is not a number n which added to its sum of digits gives 5770256446110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5770256446111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13656010 + ... + 14072210.
It is an arithmetic number, because the mean of its divisors is an integer number (122712997680).
Almost surely, 25770256446110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5770256446110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7853631851520).
5770256446110 is an abundant number, since it is smaller than the sum of its proper divisors (9937007256930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5770256446110 is a wasteful number, since it uses less digits than its factorization.
5770256446110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418114.
The product of its (nonzero) digits is 1411200, while the sum is 48.
The spelling of 5770256446110 in words is "five trillion, seven hundred seventy billion, two hundred fifty-six million, four hundred forty-six thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •