Base | Representation |
---|---|
bin | 101000101100001100101… |
… | …100111111110100001001 |
3 | 100220022120112220211221110 |
4 | 220230030230333310021 |
5 | 331303143112111014 |
6 | 5540323511400533 |
7 | 406010232622605 |
oct | 50541454776411 |
9 | 10808515824843 |
10 | 2796236832009 |
11 | 988971880795 |
12 | 391b1a083149 |
13 | 1738b79a120a |
14 | 994a5110505 |
15 | 4cb0ac2bd59 |
hex | 28b0cb3fd09 |
2796236832009 has 8 divisors (see below), whose sum is σ = 3742175687040. Its totient is φ = 1857227932496.
The previous prime is 2796236831929. The next prime is 2796236832079. The reversal of 2796236832009 is 9002386326972.
2796236832009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2796236832009 - 27 = 2796236831881 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2796236832009.
It is not an unprimeable number, because it can be changed into a prime (2796236832079) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1732487937 + ... + 1732489550.
It is an arithmetic number, because the mean of its divisors is an integer number (467771960880).
Almost surely, 22796236832009 is an apocalyptic number.
It is an amenable number.
2796236832009 is a deficient number, since it is larger than the sum of its proper divisors (945938855031).
2796236832009 is a wasteful number, since it uses less digits than its factorization.
2796236832009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3464977759.
The product of its (nonzero) digits is 11757312, while the sum is 57.
The spelling of 2796236832009 in words is "two trillion, seven hundred ninety-six billion, two hundred thirty-six million, eight hundred thirty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •