Base | Representation |
---|---|
bin | 11101111001010111… |
… | …101001011010000100 |
3 | 10001212011201102120000 |
4 | 131321113221122010 |
5 | 1011220324404444 |
6 | 22425204041300 |
7 | 2214331052355 |
oct | 357127513204 |
9 | 101764642500 |
10 | 32101013124 |
11 | 12683204314 |
12 | 627a693230 |
13 | 304774912b |
14 | 17a74b9d2c |
15 | c7d2e1469 |
hex | 7795e9684 |
32101013124 has 30 divisors (see below), whose sum is σ = 83918390094. Its totient is φ = 10700337600.
The previous prime is 32101013107. The next prime is 32101013159. The reversal of 32101013124 is 42131010123.
It can be written as a sum of positive squares in only one way, i.e., 30334492224 + 1766520900 = 174168^2 + 42030^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 32101013097 and 32101013106.
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 49538277 + ... + 49538924.
Almost surely, 232101013124 is an apocalyptic number.
It is an amenable number.
32101013124 is an abundant number, since it is smaller than the sum of its proper divisors (51817376970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32101013124 is a wasteful number, since it uses less digits than its factorization.
32101013124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99077217 (or 99077206 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 32101013124 its reverse (42131010123), we get a palindrome (74232023247).
The spelling of 32101013124 in words is "thirty-two billion, one hundred one million, thirteen thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •