Base | Representation |
---|---|
bin | 1110101100011101110010… |
… | …01001110000111100010100 |
3 | 11020102012110100100222002110 |
4 | 13112032321021300330110 |
5 | 13213413332200000112 |
6 | 152420525144311020 |
7 | 6543422434113066 |
oct | 726167111607424 |
9 | 136365410328073 |
10 | 32314145312532 |
11 | a329396667876 |
12 | 375a845a72470 |
13 | 150529825b525 |
14 | 7da02787d736 |
15 | 3b08721ee13c |
hex | 1d63b9270f14 |
32314145312532 has 48 divisors (see below), whose sum is σ = 75864147270912. Its totient is φ = 10705103418240.
The previous prime is 32314145312483. The next prime is 32314145312539. The reversal of 32314145312532 is 23521354141323.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32314145312539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1260903 + ... + 8137454.
It is an arithmetic number, because the mean of its divisors is an integer number (1580503068144).
Almost surely, 232314145312532 is an apocalyptic number.
It is an amenable number.
32314145312532 is an abundant number, since it is smaller than the sum of its proper divisors (43550001958380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32314145312532 is a wasteful number, since it uses less digits than its factorization.
32314145312532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9400128 (or 9400126 counting only the distinct ones).
The product of its digits is 259200, while the sum is 39.
Adding to 32314145312532 its reverse (23521354141323), we get a palindrome (55835499453855).
The spelling of 32314145312532 in words is "thirty-two trillion, three hundred fourteen billion, one hundred forty-five million, three hundred twelve thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •