Base | Representation |
---|---|
bin | 1010100010010001… |
… | …1100110110011010 |
3 | 21022002121202210020 |
4 | 2220210130312122 |
5 | 21243000041032 |
6 | 1144344331310 |
7 | 130040455044 |
oct | 25044346632 |
9 | 7262552706 |
10 | 2828127642 |
11 | 122144a17a |
12 | 66b173b36 |
13 | 360bc7c12 |
14 | 1cb866a94 |
15 | 118443b2c |
hex | a891cd9a |
2828127642 has 8 divisors (see below), whose sum is σ = 5656255296. Its totient is φ = 942709212.
The previous prime is 2828127583. The next prime is 2828127649. The reversal of 2828127642 is 2467218282.
It is a sphenic number, since it is the product of 3 distinct primes.
2828127642 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 2828127594 and 2828127603.
It is not an unprimeable number, because it can be changed into a prime (2828127649) 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, 235677298 + ... + 235677309.
It is an arithmetic number, because the mean of its divisors is an integer number (707031912).
Almost surely, 22828127642 is an apocalyptic number.
2828127642 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2828127642 is a wasteful number, since it uses less digits than its factorization.
2828127642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471354612.
The product of its digits is 172032, while the sum is 42.
The square root of 2828127642 is about 53180.1433055610. The cubic root of 2828127642 is about 1414.1636468203.
The spelling of 2828127642 in words is "two billion, eight hundred twenty-eight million, one hundred twenty-seven thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •