Base | Representation |
---|---|
bin | 1010100010101111… |
… | …0010000110000001 |
3 | 21022020020102022021 |
4 | 2220223302012001 |
5 | 21243443042130 |
6 | 1144453441441 |
7 | 130063011442 |
oct | 25053620601 |
9 | 7266212267 |
10 | 2830049665 |
11 | 1222542223 |
12 | 66b940281 |
13 | 36141ba01 |
14 | 1cbc072c9 |
15 | 1186c337a |
hex | a8af2181 |
2830049665 has 4 divisors (see below), whose sum is σ = 3396059604. Its totient is φ = 2264039728.
The previous prime is 2830049657. The next prime is 2830049711. The reversal of 2830049665 is 5669400382.
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 2200641921 + 629407744 = 46911^2 + 25088^2 .
It is a cyclic number.
It is not a de Polignac number, because 2830049665 - 23 = 2830049657 is a prime.
It is a super-2 number, since 2×28300496652 = 16018362212733224450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 283004962 + ... + 283004971.
It is an arithmetic number, because the mean of its divisors is an integer number (849014901).
Almost surely, 22830049665 is an apocalyptic number.
It is an amenable number.
2830049665 is a deficient number, since it is larger than the sum of its proper divisors (566009939).
2830049665 is an equidigital number, since it uses as much as digits as its factorization.
2830049665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566009938.
The product of its (nonzero) digits is 311040, while the sum is 43.
The square root of 2830049665 is about 53198.2111071416. The cubic root of 2830049665 is about 1414.4839340553.
The spelling of 2830049665 in words is "two billion, eight hundred thirty million, forty-nine thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •