Base | Representation |
---|---|
bin | 1111001000100110… |
… | …11000100000000000 |
3 | 202222021002122120201 |
4 | 13210103120200000 |
5 | 113120031104012 |
6 | 3422132214544 |
7 | 405231342046 |
oct | 74423304000 |
9 | 22867078521 |
10 | 8125253632 |
11 | 349a548351 |
12 | 16a916a454 |
13 | 9c64893b2 |
14 | 571190396 |
15 | 3284dc857 |
hex | 1e44d8800 |
8125253632 has 192 divisors, whose sum is σ = 18468777600. Its totient is φ = 3550740480.
The previous prime is 8125253629. The next prime is 8125253671. The reversal of 8125253632 is 2363525218.
It is a junction number, because it is equal to n+sod(n) for n = 8125253591 and 8125253600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46966698 + ... + 46966870.
It is an arithmetic number, because the mean of its divisors is an integer number (96191550).
Almost surely, 28125253632 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 8125253632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9234388800).
8125253632 is an abundant number, since it is smaller than the sum of its proper divisors (10343523968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8125253632 is a wasteful number, since it uses less digits than its factorization.
8125253632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302 (or 282 counting only the distinct ones).
The product of its digits is 86400, while the sum is 37.
The square root of 8125253632 is about 90140.1887728221. The cubic root of 8125253632 is about 2010.3837977377.
The spelling of 8125253632 in words is "eight billion, one hundred twenty-five million, two hundred fifty-three thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •