Base | Representation |
---|---|
bin | 1001110010110111… |
… | …0110001100000000 |
3 | 20210020102110022220 |
4 | 2130231312030000 |
5 | 20341042423003 |
6 | 1112522131040 |
7 | 122104243041 |
oct | 23455661400 |
9 | 6706373286 |
10 | 2629264128 |
11 | 112a173067 |
12 | 614650a80 |
13 | 32b94acba |
14 | 1ad29c8c8 |
15 | 105c61353 |
hex | 9cb76300 |
2629264128 has 72 divisors (see below), whose sum is σ = 7007551488. Its totient is φ = 875185152.
The previous prime is 2629264093. The next prime is 2629264129. The reversal of 2629264128 is 8214629262.
It is a self number, because there is not a number n which added to its sum of digits gives 2629264128.
It is not an unprimeable number, because it can be changed into a prime (2629264129) 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, 660801 + ... + 664767.
It is an arithmetic number, because the mean of its divisors is an integer number (97327104).
Almost surely, 22629264128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2629264128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3503775744).
2629264128 is an abundant number, since it is smaller than the sum of its proper divisors (4378287360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2629264128 is an equidigital number, since it uses as much as digits as its factorization.
2629264128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4849 (or 4835 counting only the distinct ones).
The product of its digits is 165888, while the sum is 42.
The square root of 2629264128 is about 51276.3505721692. The cubic root of 2629264128 is about 1380.2086305031.
The spelling of 2629264128 in words is "two billion, six hundred twenty-nine million, two hundred sixty-four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •