Base | Representation |
---|---|
bin | 100001011001001110100… |
… | …101111011101110101001 |
3 | 22010101100201120200212110 |
4 | 201121032211323232221 |
5 | 300044303230243024 |
6 | 4514121510432533 |
7 | 324540024346503 |
oct | 41311645735651 |
9 | 8111321520773 |
10 | 2294831102889 |
11 | 805261371196 |
12 | 310906362749 |
13 | 13852b54a080 |
14 | 7d0db326d73 |
15 | 3ea619c1629 |
hex | 2164e97bba9 |
2294831102889 has 32 divisors (see below), whose sum is σ = 3457618375680. Its totient is φ = 1343257109568.
The previous prime is 2294831102789. The next prime is 2294831102933. The reversal of 2294831102889 is 9882011384922.
It is not a de Polignac number, because 2294831102889 - 27 = 2294831102761 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2294831102089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6985639 + ... + 7306764.
It is an arithmetic number, because the mean of its divisors is an integer number (108050574240).
Almost surely, 22294831102889 is an apocalyptic number.
It is an amenable number.
2294831102889 is a deficient number, since it is larger than the sum of its proper divisors (1162787272791).
2294831102889 is a wasteful number, since it uses less digits than its factorization.
2294831102889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14292621.
The product of its (nonzero) digits is 3981312, while the sum is 57.
The spelling of 2294831102889 in words is "two trillion, two hundred ninety-four billion, eight hundred thirty-one million, one hundred two thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •