Base | Representation |
---|---|
bin | 111101011010110… |
… | …0000111011101110 |
3 | 12022121211222012020 |
4 | 1322311200323232 |
5 | 13210034131003 |
6 | 540255051010 |
7 | 102032632524 |
oct | 17265407356 |
9 | 5277758166 |
10 | 2060848878 |
11 | 9683282a0 |
12 | 496210a66 |
13 | 26ac6080a |
14 | 1579b8314 |
15 | c0dd1d53 |
hex | 7ad60eee |
2060848878 has 32 divisors (see below), whose sum is σ = 4572616320. Its totient is φ = 613913760.
The previous prime is 2060848877. The next prime is 2060848879. The reversal of 2060848878 is 8788480602.
It is an interprime number because it is at equal distance from previous prime (2060848877) and next prime (2060848879).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2060848878.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2060848877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 260725 + ... + 268512.
It is an arithmetic number, because the mean of its divisors is an integer number (142894260).
Almost surely, 22060848878 is an apocalyptic number.
2060848878 is an abundant number, since it is smaller than the sum of its proper divisors (2511767442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2060848878 is a wasteful number, since it uses less digits than its factorization.
2060848878 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529312.
The product of its (nonzero) digits is 1376256, while the sum is 51.
The square root of 2060848878 is about 45396.5734169441. The cubic root of 2060848878 is about 1272.5710780208.
The spelling of 2060848878 in words is "two billion, sixty million, eight hundred forty-eight thousand, eight hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •