Base | Representation |
---|---|
bin | 1010100010010001… |
… | …1101110001101101 |
3 | 21022002121221222210 |
4 | 2220210131301231 |
5 | 21243000201222 |
6 | 1144344401033 |
7 | 130040502105 |
oct | 25044356155 |
9 | 7262557883 |
10 | 2828131437 |
11 | 122145200a |
12 | 66b176179 |
13 | 360bc9871 |
14 | 1cb868205 |
15 | 118444d0c |
hex | a891dc6d |
2828131437 has 8 divisors (see below), whose sum is σ = 3969307360. Its totient is φ = 1786188240.
The previous prime is 2828131433. The next prime is 2828131447. The reversal of 2828131437 is 7341318282.
2828131437 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2828131437 - 22 = 2828131433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2828131395 and 2828131404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2828131433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24808114 + ... + 24808227.
It is an arithmetic number, because the mean of its divisors is an integer number (496163420).
Almost surely, 22828131437 is an apocalyptic number.
It is an amenable number.
2828131437 is a deficient number, since it is larger than the sum of its proper divisors (1141175923).
2828131437 is a wasteful number, since it uses less digits than its factorization.
2828131437 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49616363.
The product of its digits is 64512, while the sum is 39.
The square root of 2828131437 is about 53180.1789861599. The cubic root of 2828131437 is about 1414.1642793647.
The spelling of 2828131437 in words is "two billion, eight hundred twenty-eight million, one hundred thirty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •