Base | Representation |
---|---|
bin | 11101111010100101… |
… | …000111101010010011 |
3 | 10001220120221020021110 |
4 | 131322211013222103 |
5 | 1011241024302011 |
6 | 22431211224403 |
7 | 2214665506323 |
oct | 357245075223 |
9 | 101816836243 |
10 | 32121322131 |
11 | 12693715818 |
12 | 6285448103 |
13 | 304ba0a0b2 |
14 | 17aa085283 |
15 | c7eea3ba6 |
hex | 77a947a93 |
32121322131 has 4 divisors (see below), whose sum is σ = 42828429512. Its totient is φ = 21414214752.
The previous prime is 32121322127. The next prime is 32121322139. The reversal of 32121322131 is 13122312123.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13122312123 = 3 ⋅4374104041.
It is not a de Polignac number, because 32121322131 - 22 = 32121322127 is a prime.
It is a super-2 number, since 2×321213221312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32121322098 and 32121322107.
It is not an unprimeable number, because it can be changed into a prime (32121322139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5353553686 + ... + 5353553691.
It is an arithmetic number, because the mean of its divisors is an integer number (10707107378).
Almost surely, 232121322131 is an apocalyptic number.
32121322131 is a deficient number, since it is larger than the sum of its proper divisors (10707107381).
32121322131 is a wasteful number, since it uses less digits than its factorization.
32121322131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10707107380.
The product of its digits is 432, while the sum is 21.
Adding to 32121322131 its reverse (13122312123), we get a palindrome (45243634254).
The spelling of 32121322131 in words is "thirty-two billion, one hundred twenty-one million, three hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •