Base | Representation |
---|---|
bin | 101001111010110010011… |
… | …001001000010000000001 |
3 | 101012101101102122202110101 |
4 | 221322302121020100001 |
5 | 334144002440121121 |
6 | 10043201121402401 |
7 | 415055321446063 |
oct | 51726231102001 |
9 | 11171342582411 |
10 | 2880621020161 |
11 | a10734517265 |
12 | 3a634a199401 |
13 | 17b8451c0cb1 |
14 | 9d5cc249733 |
15 | 4ede905e491 |
hex | 29eb2648401 |
2880621020161 has 4 divisors (see below), whose sum is σ = 2881152799812. Its totient is φ = 2880089240512.
The previous prime is 2880621020149. The next prime is 2880621020239. The reversal of 2880621020161 is 1610201260882.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 97863234561 + 2782757785600 = 312831^2 + 1668160^2 .
It is a cyclic number.
It is not a de Polignac number, because 2880621020161 - 27 = 2880621020033 is a prime.
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 2880621020161.
It is not an unprimeable number, because it can be changed into a prime (2880621020461) 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, 265881700 + ... + 265892533.
It is an arithmetic number, because the mean of its divisors is an integer number (720288199953).
Almost surely, 22880621020161 is an apocalyptic number.
It is an amenable number.
2880621020161 is a deficient number, since it is larger than the sum of its proper divisors (531779651).
2880621020161 is an equidigital number, since it uses as much as digits as its factorization.
2880621020161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 531779650.
The product of its (nonzero) digits is 18432, while the sum is 37.
The spelling of 2880621020161 in words is "two trillion, eight hundred eighty billion, six hundred twenty-one million, twenty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •