Base | Representation |
---|---|
bin | 1110101001011110001111… |
… | …01100001011110100001101 |
3 | 11020001101000120120220012010 |
4 | 13110233013230023310031 |
5 | 13210222230330021141 |
6 | 152301401014531433 |
7 | 6533122201310325 |
oct | 724570754136415 |
9 | 136041016526163 |
10 | 32211310001421 |
11 | a299815826551 |
12 | 3742926666b79 |
13 | 14c868a20a305 |
14 | 7d5070046285 |
15 | 3acd54102416 |
hex | 1d4bc7b0bd0d |
32211310001421 has 4 divisors (see below), whose sum is σ = 42948413335232. Its totient is φ = 21474206667612.
The previous prime is 32211310001407. The next prime is 32211310001443. The reversal of 32211310001421 is 12410001311223.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 32211310001421 - 225 = 32211276446989 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 (32211310001461) 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, 5368551666901 + ... + 5368551666906.
It is an arithmetic number, because the mean of its divisors is an integer number (10737103333808).
Almost surely, 232211310001421 is an apocalyptic number.
It is an amenable number.
32211310001421 is a deficient number, since it is larger than the sum of its proper divisors (10737103333811).
32211310001421 is a wasteful number, since it uses less digits than its factorization.
32211310001421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10737103333810.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 32211310001421 its reverse (12410001311223), we get a palindrome (44621311312644).
The spelling of 32211310001421 in words is "thirty-two trillion, two hundred eleven billion, three hundred ten million, one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.276 sec. • engine limits •