Base | Representation |
---|---|
bin | 11000001001011110111… |
… | …01101100000101000000 |
3 | 2221022122221222012021120 |
4 | 30010233131230011000 |
5 | 102043234100000000 |
6 | 1433100450152240 |
7 | 113642234063421 |
oct | 14045735540500 |
9 | 2838587865246 |
10 | 829725000000 |
11 | 29a98014a1a6 |
12 | 114981282680 |
13 | 60320387b80 |
14 | 2c232067648 |
15 | 168b2be96a0 |
hex | c12f76c140 |
829725000000 has 1008 divisors, whose sum is σ = 3167060878464. Its totient is φ = 190080000000.
The previous prime is 829724999923. The next prime is 829725000029. The reversal of 829725000000 is 527928.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 22424999982 + ... + 22425000018.
Almost surely, 2829725000000 is an apocalyptic number.
829725000000 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 829725000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1583530439232).
829725000000 is an abundant number, since it is smaller than the sum of its proper divisors (2337335878464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
829725000000 is an frugal number, since it uses more digits than its factorization.
829725000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 83 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
Adding to 829725000000 its reverse (527928), we get a palindrome (829725527928).
The spelling of 829725000000 in words is "eight hundred twenty-nine billion, seven hundred twenty-five million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •