Base | Representation |
---|---|
bin | 111101010001… |
… | …0000010110101 |
3 | 2020102220202011 |
4 | 1322202002311 |
5 | 31210333023 |
6 | 3104244221 |
7 | 540011161 |
oct | 172420265 |
9 | 66386664 |
10 | 32121013 |
11 | 17149aa1 |
12 | a910671 |
13 | 6868522 |
14 | 43a1ca1 |
15 | 2c4750d |
hex | 1ea20b5 |
32121013 has 8 divisors (see below), whose sum is σ = 32460480. Its totient is φ = 31783680.
The previous prime is 32120993. The next prime is 32121029. The reversal of 32121013 is 31012123.
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 32121013 - 25 = 32120981 is a prime.
It is a super-2 number, since 2×321210132 = 2063518952292338, 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 = 32120984 and 32121002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32121113) 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, 55381 + ... + 55957.
It is an arithmetic number, because the mean of its divisors is an integer number (4057560).
Almost surely, 232121013 is an apocalyptic number.
It is an amenable number.
32121013 is a deficient number, since it is larger than the sum of its proper divisors (339467).
32121013 is a wasteful number, since it uses less digits than its factorization.
32121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1067.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 32121013 is about 5667.5402954015. The cubic root of 32121013 is about 317.8799073181.
Adding to 32121013 its reverse (31012123), we get a palindrome (63133136).
It can be divided in two parts, 3212 and 1013, that added together give a square (4225 = 652).
The spelling of 32121013 in words is "thirty-two million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •