Base | Representation |
---|---|
bin | 1010001100100000… |
… | …0101010010000000 |
3 | 21001201210002122212 |
4 | 2203020011102000 |
5 | 21101110224432 |
6 | 1131323121252 |
7 | 124551313205 |
oct | 24310052200 |
9 | 7051702585 |
10 | 2736804992 |
11 | 1184945109 |
12 | 644673228 |
13 | 348001c4c |
14 | 1bd693cac |
15 | 1104052b2 |
hex | a3205480 |
2736804992 has 96 divisors (see below), whose sum is σ = 5935359600. Its totient is φ = 1253491200.
The previous prime is 2736804991. The next prime is 2736805009. The reversal of 2736804992 is 2994086372.
It is a super-2 number, since 2×27368049922 = 14980203128472240128, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2736804992.
It is not an unprimeable number, because it can be changed into a prime (2736804991) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2336567 + ... + 2337737.
Almost surely, 22736804992 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 2736804992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2967679800).
2736804992 is an abundant number, since it is smaller than the sum of its proper divisors (3198554608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2736804992 is a wasteful number, since it uses less digits than its factorization.
2736804992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1266 (or 1223 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 50.
The square root of 2736804992 is about 52314.4816661696. The cubic root of 2736804992 is about 1398.7752881252.
The spelling of 2736804992 in words is "two billion, seven hundred thirty-six million, eight hundred four thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •