Base | Representation |
---|---|
bin | 11101101001000110… |
… | …010101111000100100 |
3 | 10001011011002000112200 |
4 | 131221012111320210 |
5 | 1010140434310002 |
6 | 22342133214500 |
7 | 2204504613120 |
oct | 355106257044 |
9 | 101134060480 |
10 | 31828041252 |
11 | 12553110527 |
12 | 6203191430 |
13 | 3003022707 |
14 | 177d140580 |
15 | c64370b1c |
hex | 769195e24 |
31828041252 has 144 divisors (see below), whose sum is σ = 92554250880. Its totient is φ = 9033970176.
The previous prime is 31828041251. The next prime is 31828041281. The reversal of 31828041252 is 25214082813.
It is a happy number.
31828041252 is a `hidden beast` number, since 318 + 280 + 4 + 12 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (31828041251) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 43068699 + ... + 43069437.
Almost surely, 231828041252 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 31828041252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46277125440).
31828041252 is an abundant number, since it is smaller than the sum of its proper divisors (60726209628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31828041252 is a wasteful number, since it uses less digits than its factorization.
31828041252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1650 (or 1645 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 36.
The spelling of 31828041252 in words is "thirty-one billion, eight hundred twenty-eight million, forty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •