Base | Representation |
---|---|
bin | 1010011100101001… |
… | …0000110000001101 |
3 | 21020110010121100202 |
4 | 2213022100300031 |
5 | 21220422011013 |
6 | 1142141503245 |
7 | 126332505332 |
oct | 24712206015 |
9 | 7213117322 |
10 | 2804485133 |
11 | 120a07120a |
12 | 663271b25 |
13 | 35903a878 |
14 | 1c8670989 |
15 | 116323858 |
hex | a7290c0d |
2804485133 has 8 divisors (see below), whose sum is σ = 2847376896. Its totient is φ = 2761894800.
The previous prime is 2804485111. The next prime is 2804485199. The reversal of 2804485133 is 3315844082.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2804485133 - 224 = 2787707917 is a prime.
It is a super-2 number, since 2×28044851332 = 15730273722436055378, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2804485433) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 56573 + ... + 93858.
It is an arithmetic number, because the mean of its divisors is an integer number (355922112).
Almost surely, 22804485133 is an apocalyptic number.
It is an amenable number.
2804485133 is a deficient number, since it is larger than the sum of its proper divisors (42891763).
2804485133 is a wasteful number, since it uses less digits than its factorization.
2804485133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150715.
The product of its (nonzero) digits is 92160, while the sum is 38.
The square root of 2804485133 is about 52957.3897865067. The cubic root of 2804485133 is about 1410.2119180833.
The spelling of 2804485133 in words is "two billion, eight hundred four million, four hundred eighty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •