Base | Representation |
---|---|
bin | 1010010111000100… |
… | …1000011001100000 |
3 | 21011211011112120000 |
4 | 2211301020121200 |
5 | 21143431320341 |
6 | 1135545020000 |
7 | 125630062566 |
oct | 24561103140 |
9 | 7154145500 |
10 | 2781120096 |
11 | 11a7962767 |
12 | 657484600 |
13 | 3542498c1 |
14 | 1c550ba36 |
15 | 11425a8b6 |
hex | a5c48660 |
2781120096 has 240 divisors, whose sum is σ = 8592889536. Its totient is φ = 881362944.
The previous prime is 2781120091. The next prime is 2781120109. The reversal of 2781120096 is 6900211872.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2781120096.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2781120091) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4507180 + ... + 4507796.
Almost surely, 22781120096 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 2781120096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4296444768).
2781120096 is an abundant number, since it is smaller than the sum of its proper divisors (5811769440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2781120096 is a wasteful number, since it uses less digits than its factorization.
2781120096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 723 (or 706 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The square root of 2781120096 is about 52736.3261519041. The cubic root of 2781120096 is about 1406.2846869311.
The spelling of 2781120096 in words is "two billion, seven hundred eighty-one million, one hundred twenty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •