Base | Representation |
---|---|
bin | 1010011100100001… |
… | …1101000001101101 |
3 | 21020102020112010121 |
4 | 2213020131001231 |
5 | 21220311323432 |
6 | 1142123404541 |
7 | 126325462345 |
oct | 24710350155 |
9 | 7212215117 |
10 | 2804011117 |
11 | 1209878066 |
12 | 663083751 |
13 | 358c02b9b |
14 | 1c8589d25 |
15 | 11627d197 |
hex | a721d06d |
2804011117 has 4 divisors (see below), whose sum is σ = 2863670976. Its totient is φ = 2744351260.
The previous prime is 2804011099. The next prime is 2804011129. The reversal of 2804011117 is 7111104082.
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 2804011117 - 215 = 2803978349 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2804011091 and 2804011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2804018117) 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, 29829859 + ... + 29829952.
It is an arithmetic number, because the mean of its divisors is an integer number (715917744).
Almost surely, 22804011117 is an apocalyptic number.
It is an amenable number.
2804011117 is a deficient number, since it is larger than the sum of its proper divisors (59659859).
2804011117 is an equidigital number, since it uses as much as digits as its factorization.
2804011117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59659858.
The product of its (nonzero) digits is 448, while the sum is 25.
The square root of 2804011117 is about 52952.9141502146. The cubic root of 2804011117 is about 1410.1324619448.
Adding to 2804011117 its reverse (7111104082), we get a palindrome (9915115199).
The spelling of 2804011117 in words is "two billion, eight hundred four million, eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •