Base | Representation |
---|---|
bin | 11101111011110100… |
… | …110100010001000101 |
3 | 10001222001020122211021 |
4 | 131323310310101011 |
5 | 1011311401323323 |
6 | 22433235111141 |
7 | 2215341212224 |
oct | 357364642105 |
9 | 101861218737 |
10 | 32142214213 |
11 | 126a44952aa |
12 | 62904424b1 |
13 | 3053143585 |
14 | 17acb62cbb |
15 | c81c2e05d |
hex | 77bd34445 |
32142214213 has 4 divisors (see below), whose sum is σ = 32153546700. Its totient is φ = 32130881728.
The previous prime is 32142214199. The next prime is 32142214217. The reversal of 32142214213 is 31241224123.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4949544609 + 27192669604 = 70353^2 + 164902^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32142214213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32142214217) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 5661988 + ... + 5667661.
It is an arithmetic number, because the mean of its divisors is an integer number (8038386675).
Almost surely, 232142214213 is an apocalyptic number.
It is an amenable number.
32142214213 is a deficient number, since it is larger than the sum of its proper divisors (11332487).
32142214213 is a wasteful number, since it uses less digits than its factorization.
32142214213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11332486.
The product of its digits is 2304, while the sum is 25.
Adding to 32142214213 its reverse (31241224123), we get a palindrome (63383438336).
The spelling of 32142214213 in words is "thirty-two billion, one hundred forty-two million, two hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •