Base | Representation |
---|---|
bin | 11110010001011010… |
… | …100001011011000000 |
3 | 10002220021210121210121 |
4 | 132101122201123000 |
5 | 1013032112420112 |
6 | 22533214310024 |
7 | 2230330003660 |
oct | 362132413300 |
9 | 102807717717 |
10 | 32504420032 |
11 | 1286a996957 |
12 | 63717b8314 |
13 | 30b01b1346 |
14 | 1804cca1a0 |
15 | ca3929407 |
hex | 7916a16c0 |
32504420032 has 112 divisors (see below), whose sum is σ = 75498350400. Its totient is φ = 13596291072.
The previous prime is 32504420027. The next prime is 32504420083. The reversal of 32504420032 is 23002440523.
It is a tau number, because it is divible by the number of its divisors (112).
It is a junction number, because it is equal to n+sod(n) for n = 32504419979 and 32504420006.
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, 4674094 + ... + 4681042.
Almost surely, 232504420032 is an apocalyptic number.
32504420032 is a gapful number since it is divisible by the number (32) 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 32504420032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37749175200).
32504420032 is an abundant number, since it is smaller than the sum of its proper divisors (42993930368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32504420032 is a wasteful number, since it uses less digits than its factorization.
32504420032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7218 (or 7208 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 25.
Adding to 32504420032 its reverse (23002440523), we get a palindrome (55506860555).
The spelling of 32504420032 in words is "thirty-two billion, five hundred four million, four hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •