Base | Representation |
---|---|
bin | 101001001110001100110… |
… | …000110110101100000101 |
3 | 101000210210212121020220002 |
4 | 221032030300312230011 |
5 | 332402430214041341 |
6 | 10005202313451045 |
7 | 411442030524401 |
oct | 51161460665405 |
9 | 11023725536802 |
10 | 2832745065221 |
11 | 9a23a6815755 |
12 | 399008710a85 |
13 | 17718550a786 |
14 | 9b169a64101 |
15 | 4da45dd129b |
hex | 2938cc36b05 |
2832745065221 has 4 divisors (see below), whose sum is σ = 2841303207744. Its totient is φ = 2824186922700.
The previous prime is 2832745065197. The next prime is 2832745065257. The reversal of 2832745065221 is 1225605472382.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2832745065221 - 226 = 2832677956357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2832745065121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4279070765 + ... + 4279071426.
It is an arithmetic number, because the mean of its divisors is an integer number (710325801936).
Almost surely, 22832745065221 is an apocalyptic number.
It is an amenable number.
2832745065221 is a deficient number, since it is larger than the sum of its proper divisors (8558142523).
2832745065221 is an equidigital number, since it uses as much as digits as its factorization.
2832745065221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8558142522.
The product of its (nonzero) digits is 1612800, while the sum is 47.
The spelling of 2832745065221 in words is "two trillion, eight hundred thirty-two billion, seven hundred forty-five million, sixty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •