Base | Representation |
---|---|
bin | 101001101110011110100… |
… | …111011011000101000000 |
3 | 101011010021100002212202022 |
4 | 221232132213123011000 |
5 | 333434421001233323 |
6 | 10033133425541012 |
7 | 414106644403526 |
oct | 51563647330500 |
9 | 11133240085668 |
10 | 2867404321088 |
11 | a06071a9366a |
12 | 3a387baa4768 |
13 | 17a519c691b8 |
14 | 9cad6bd2316 |
15 | 4e8c3aa54c8 |
hex | 29b9e9db140 |
2867404321088 has 28 divisors (see below), whose sum is σ = 5886212537940. Its totient is φ = 1384264154112.
The previous prime is 2867404321087. The next prime is 2867404321151. The reversal of 2867404321088 is 8801234047682.
2867404321088 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 981748052224 + 1885656268864 = 990832^2 + 1373192^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2867404321087) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 772466981 + ... + 772470692.
It is an arithmetic number, because the mean of its divisors is an integer number (210221876355).
Almost surely, 22867404321088 is an apocalyptic number.
It is an amenable number.
2867404321088 is an abundant number, since it is smaller than the sum of its proper divisors (3018808216852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2867404321088 is a wasteful number, since it uses less digits than its factorization.
2867404321088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544937714 (or 1544937704 counting only the distinct ones).
The product of its (nonzero) digits is 4128768, while the sum is 53.
The spelling of 2867404321088 in words is "two trillion, eight hundred sixty-seven billion, four hundred four million, three hundred twenty-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •