Base | Representation |
---|---|
bin | 1010111101100111… |
… | …0111101100101000 |
3 | 21121002101110012020 |
4 | 2233121313230220 |
5 | 22011323411121 |
6 | 1204002144440 |
7 | 132632224623 |
oct | 25731675450 |
9 | 7532343166 |
10 | 2942794536 |
11 | 1280149100 |
12 | 6a1652120 |
13 | 37b8a5556 |
14 | 1dcb94dba |
15 | 1235441c6 |
hex | af677b28 |
2942794536 has 192 divisors, whose sum is σ = 8458544640. Its totient is φ = 851558400.
The previous prime is 2942794489. The next prime is 2942794553. The reversal of 2942794536 is 6354972492.
It is a super-2 number, since 2×29427945362 = 17320079362222910592, which contains 22 as substring.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 8732160 + ... + 8732496.
It is an arithmetic number, because the mean of its divisors is an integer number (44054920).
Almost surely, 22942794536 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 2942794536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4229272320).
2942794536 is an abundant number, since it is smaller than the sum of its proper divisors (5515750104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2942794536 is a wasteful number, since it uses less digits than its factorization.
2942794536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496 (or 481 counting only the distinct ones).
The product of its digits is 3265920, while the sum is 51.
The square root of 2942794536 is about 54247.5302294952. The cubic root of 2942794536 is about 1433.0235041637.
The spelling of 2942794536 in words is "two billion, nine hundred forty-two million, seven hundred ninety-four thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •