Base | Representation |
---|---|
bin | 11110001011010010… |
… | …110001100000000000 |
3 | 10002122010120012022012 |
4 | 132023102301200000 |
5 | 1012324320203230 |
6 | 22515105232052 |
7 | 2224642056560 |
oct | 361322614000 |
9 | 102563505265 |
10 | 32401725440 |
11 | 12817a24997 |
12 | 6343332628 |
13 | 3094b36206 |
14 | 17d53d6da0 |
15 | c998e1395 |
hex | 78b4b1800 |
32401725440 has 96 divisors (see below), whose sum is σ = 88851803040. Its totient is φ = 11109138432.
The previous prime is 32401725439. The next prime is 32401725443. The reversal of 32401725440 is 4452710423.
It is a super-2 number, since 2×324017254402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 32401725397 and 32401725406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32401725443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154337 + ... + 297696.
It is an arithmetic number, because the mean of its divisors is an integer number (925539615).
Almost surely, 232401725440 is an apocalyptic number.
It is an amenable number.
32401725440 is an abundant number, since it is smaller than the sum of its proper divisors (56450077600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32401725440 is an equidigital number, since it uses as much as digits as its factorization.
32401725440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452067 (or 452047 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 32.
The spelling of 32401725440 in words is "thirty-two billion, four hundred one million, seven hundred twenty-five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •