Base | Representation |
---|---|
bin | 11101110100101111… |
… | …101101000011100000 |
3 | 10001122202201222020101 |
4 | 131310233231003200 |
5 | 1011040444332230 |
6 | 22413353152144 |
7 | 2212366456465 |
oct | 356457550340 |
9 | 101582658211 |
10 | 32023433440 |
11 | 12643436579 |
12 | 62586bb654 |
13 | 30346555ab |
14 | 179b08366c |
15 | c765b9aca |
hex | 774bed0e0 |
32023433440 has 48 divisors (see below), whose sum is σ = 75771466848. Its totient is φ = 12789715456.
The previous prime is 32023433419. The next prime is 32023433447. The reversal of 32023433440 is 4433432023.
It is a super-2 number, since 2×320234334402 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32023433399 and 32023433408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32023433447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48772 + ... + 257731.
It is an arithmetic number, because the mean of its divisors is an integer number (1578572226).
Almost surely, 232023433440 is an apocalyptic number.
It is an amenable number.
32023433440 is an abundant number, since it is smaller than the sum of its proper divisors (43748033408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32023433440 is a wasteful number, since it uses less digits than its factorization.
32023433440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307171 (or 307163 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 28.
Adding to 32023433440 its reverse (4433432023), we get a palindrome (36456865463).
The spelling of 32023433440 in words is "thirty-two billion, twenty-three million, four hundred thirty-three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •