Base | Representation |
---|---|
bin | 1001110000110110… |
… | …1010101100001100 |
3 | 20202122112212201120 |
4 | 2130031222230030 |
5 | 20331413002203 |
6 | 1112021240540 |
7 | 121642450131 |
oct | 23415525414 |
9 | 6678485646 |
10 | 2620828428 |
11 | 1125431209 |
12 | 611863150 |
13 | 329c8646a |
14 | 1ac104588 |
15 | 105146b53 |
hex | 9c36ab0c |
2620828428 has 12 divisors (see below), whose sum is σ = 6115266360. Its totient is φ = 873609472.
The previous prime is 2620828423. The next prime is 2620828453. The reversal of 2620828428 is 8248280262.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 2620828428.
It is not an unprimeable number, because it can be changed into a prime (2620828423) 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, 109201173 + ... + 109201196.
It is an arithmetic number, because the mean of its divisors is an integer number (509605530).
Almost surely, 22620828428 is an apocalyptic number.
It is an amenable number.
2620828428 is an abundant number, since it is smaller than the sum of its proper divisors (3494437932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2620828428 is a wasteful number, since it uses less digits than its factorization.
2620828428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218402376 (or 218402374 counting only the distinct ones).
The product of its (nonzero) digits is 196608, while the sum is 42.
The square root of 2620828428 is about 51194.0272688133. The cubic root of 2620828428 is about 1378.7309673749.
The spelling of 2620828428 in words is "two billion, six hundred twenty million, eight hundred twenty-eight thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •