Base | Representation |
---|---|
bin | 111100011110101… |
… | …0000011100000000 |
3 | 12020102112100020100 |
4 | 1320331100130000 |
5 | 13124001332112 |
6 | 533211242400 |
7 | 101200653411 |
oct | 17075203400 |
9 | 5212470210 |
10 | 2029324032 |
11 | 9515561aa |
12 | 487749400 |
13 | 264573768 |
14 | 15372d808 |
15 | bd2562dc |
hex | 78f50700 |
2029324032 has 216 divisors, whose sum is σ = 6219973760. Its totient is φ = 634521600.
The previous prime is 2029324009. The next prime is 2029324091. The reversal of 2029324032 is 2304239202.
It is a super-3 number, since 3×20293240323 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2029323987 and 2029324005.
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 23 ways as a sum of consecutive naturals, for example, 6610023 + ... + 6610329.
Almost surely, 22029324032 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 2029324032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3109986880).
2029324032 is an abundant number, since it is smaller than the sum of its proper divisors (4190649728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2029324032 is a wasteful number, since it uses less digits than its factorization.
2029324032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499 (or 482 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 2029324032 is about 45048.0191795377. The cubic root of 2029324032 is about 1266.0488589516.
The spelling of 2029324032 in words is "two billion, twenty-nine million, three hundred twenty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •