Base | Representation |
---|---|
bin | 111101010011… |
… | …0111110011101 |
3 | 2020110221110022 |
4 | 1322212332131 |
5 | 31212004323 |
6 | 3104521525 |
7 | 540124106 |
oct | 172467635 |
9 | 66427408 |
10 | 32141213 |
11 | 17163195 |
12 | a9202a5 |
13 | 6874790 |
14 | 43a93ad |
15 | 2c4d4c8 |
hex | 1ea6f9d |
32141213 has 8 divisors (see below), whose sum is σ = 34771968. Its totient is φ = 29533104.
The previous prime is 32141209. The next prime is 32141227. The reversal of 32141213 is 31214123.
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 32141213 - 22 = 32141209 is a prime.
It is a super-2 number, since 2×321412132 = 2066115146222738, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32141191 and 32141200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32141233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2645 + ... + 8442.
It is an arithmetic number, because the mean of its divisors is an integer number (4346496).
Almost surely, 232141213 is an apocalyptic number.
It is an amenable number.
32141213 is a deficient number, since it is larger than the sum of its proper divisors (2630755).
32141213 is a wasteful number, since it uses less digits than its factorization.
32141213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11323.
The product of its digits is 144, while the sum is 17.
The square root of 32141213 is about 5669.3220935135. The cubic root of 32141213 is about 317.9465285936.
Adding to 32141213 its reverse (31214123), we get a palindrome (63355336).
The spelling of 32141213 in words is "thirty-two million, one hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •