Base | Representation |
---|---|
bin | 111110101001010… |
… | …0000110101000000 |
3 | 12102111021220212010 |
4 | 1331102200311000 |
5 | 13301103130211 |
6 | 544325132520 |
7 | 103042514424 |
oct | 17522406500 |
9 | 5374256763 |
10 | 2102005056 |
11 | 989588568 |
12 | 4a7b5a140 |
13 | 276640698 |
14 | 15d24cb84 |
15 | c48114a6 |
hex | 7d4a0d40 |
2102005056 has 112 divisors (see below), whose sum is σ = 5724875520. Its totient is φ = 680263680.
The previous prime is 2102005043. The next prime is 2102005063. The reversal of 2102005056 is 6505002012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2022585 + ... + 2023623.
It is an arithmetic number, because the mean of its divisors is an integer number (51114960).
Almost surely, 22102005056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2102005056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2862437760).
2102005056 is an abundant number, since it is smaller than the sum of its proper divisors (3622870464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102005056 is a wasteful number, since it uses less digits than its factorization.
2102005056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1352 (or 1342 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 2102005056 is about 45847.6286845896. The cubic root of 2102005056 is about 1280.9865961286.
Adding to 2102005056 its reverse (6505002012), we get a palindrome (8607007068).
The spelling of 2102005056 in words is "two billion, one hundred two million, five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •