Base | Representation |
---|---|
bin | 111101010010… |
… | …0011111001101 |
3 | 2020110102110211 |
4 | 1322210133031 |
5 | 31211143041 |
6 | 3104402421 |
7 | 540052306 |
oct | 172443715 |
9 | 66412424 |
10 | 32131021 |
11 | 1715656a |
12 | a916411 |
13 | 686cc50 |
14 | 43a57ad |
15 | 2c4a481 |
hex | 1ea47cd |
32131021 has 8 divisors (see below), whose sum is σ = 34857144. Its totient is φ = 29441280.
The previous prime is 32131007. The next prime is 32131027. The reversal of 32131021 is 12013123.
It can be written as a sum of positive squares in 4 ways, for example, as 84100 + 32046921 = 290^2 + 5661^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32131021 - 27 = 32130893 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32130992 and 32131010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32131027) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7240 + ... + 10801.
It is an arithmetic number, because the mean of its divisors is an integer number (4357143).
Almost surely, 232131021 is an apocalyptic number.
It is an amenable number.
32131021 is a deficient number, since it is larger than the sum of its proper divisors (2726123).
32131021 is a wasteful number, since it uses less digits than its factorization.
32131021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18191.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 32131021 is about 5668.4231493423. The cubic root of 32131021 is about 317.9129180222.
Adding to 32131021 its reverse (12013123), we get a palindrome (44144144).
The spelling of 32131021 in words is "thirty-two million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •