Base | Representation |
---|---|
bin | 11000000111100011100… |
… | …10000001111110000000 |
3 | 2221012222211201010022020 |
4 | 30003301302001332000 |
5 | 102034124134121102 |
6 | 1432410041441440 |
7 | 113604500004042 |
oct | 14036162017600 |
9 | 2835884633266 |
10 | 828690145152 |
11 | 29a499a8a461 |
12 | 1147327a0280 |
13 | 601b6b6601c |
14 | 2c174845a92 |
15 | 16851e30bbc |
hex | c0f1c81f80 |
828690145152 has 128 divisors (see below), whose sum is σ = 2260471449600. Its totient is φ = 268858091520.
The previous prime is 828690145141. The next prime is 828690145169. The reversal of 828690145152 is 251541096828.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 828690145095 and 828690145104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3139849 + ... + 3393527.
It is an arithmetic number, because the mean of its divisors is an integer number (17659933200).
Almost surely, 2828690145152 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 828690145152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1130235724800).
828690145152 is an abundant number, since it is smaller than the sum of its proper divisors (1431781304448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
828690145152 is a wasteful number, since it uses less digits than its factorization.
828690145152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253924 (or 253912 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 51.
The spelling of 828690145152 in words is "eight hundred twenty-eight billion, six hundred ninety million, one hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •