Base | Representation |
---|---|
bin | 111101010110001… |
… | …101011000000000 |
3 | 2122201200102001110 |
4 | 331112031120000 |
5 | 4101440412003 |
6 | 250044003320 |
7 | 34335220521 |
oct | 7526153000 |
9 | 2581612043 |
10 | 1029232128 |
11 | 488a7a371 |
12 | 248830540 |
13 | 1353037c2 |
14 | 9a99a848 |
15 | 60557a03 |
hex | 3d58d600 |
1029232128 has 80 divisors (see below), whose sum is σ = 2886333120. Its totient is φ = 325011456.
The previous prime is 1029232111. The next prime is 1029232151. The reversal of 1029232128 is 8212329201.
It is a junction number, because it is equal to n+sod(n) for n = 1029232095 and 1029232104.
It is a congruent number.
It is an unprimeable number.
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, 11551 + ... + 46817.
It is an arithmetic number, because the mean of its divisors is an integer number (36079164).
Almost surely, 21029232128 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 1029232128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1443166560).
1029232128 is an abundant number, since it is smaller than the sum of its proper divisors (1857100992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1029232128 is an equidigital number, since it uses as much as digits as its factorization.
1029232128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35307 (or 35291 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 30.
The square root of 1029232128 is about 32081.6478379774. The cubic root of 1029232128 is about 1009.6506088154.
The spelling of 1029232128 in words is "one billion, twenty-nine million, two hundred thirty-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •