Base | Representation |
---|---|
bin | 101010000001101010010… |
… | …110101011000000001000 |
3 | 101020002102211221012222012 |
4 | 222001222112223000020 |
5 | 334304112100213422 |
6 | 10050421401115052 |
7 | 415436250643304 |
oct | 52015226530010 |
9 | 11202384835865 |
10 | 2888002351112 |
11 | a1388204547a |
12 | 3a786a188a88 |
13 | 17c4504ccb48 |
14 | 9dacc6aad04 |
15 | 501cc0a04e2 |
hex | 2a06a5ab008 |
2888002351112 has 12 divisors (see below), whose sum is σ = 5415013420845. Its totient is φ = 1443998772224.
The previous prime is 2888002351061. The next prime is 2888002351127. The reversal of 2888002351112 is 2111532008882.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 2235341951236 + 652660399876 = 1495106^2 + 807874^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=1201666.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2888002351112.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 4506248 + ... + 5107080.
Almost surely, 22888002351112 is an apocalyptic number.
It is an amenable number.
2888002351112 is a deficient number, since it is larger than the sum of its proper divisors (2527011069733).
2888002351112 is an frugal number, since it uses more digits than its factorization.
2888002351112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201672 (or 600835 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 41.
Adding to 2888002351112 its reverse (2111532008882), we get a palindrome (4999534359994).
The spelling of 2888002351112 in words is "two trillion, eight hundred eighty-eight billion, two million, three hundred fifty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •