Base | Representation |
---|---|
bin | 11101111111111011… |
… | …101001000111100101 |
3 | 10002010211220001101202 |
4 | 131333323221013211 |
5 | 1011432021044141 |
6 | 22444135532245 |
7 | 2220135636515 |
oct | 357773510745 |
9 | 102124801352 |
10 | 32211112421 |
11 | 1272a373574 |
12 | 62ab52a085 |
13 | 30644b7747 |
14 | 17b7d79845 |
15 | c87cdd49b |
hex | 77fee91e5 |
32211112421 has 2 divisors, whose sum is σ = 32211112422. Its totient is φ = 32211112420.
The previous prime is 32211112393. The next prime is 32211112447. The reversal of 32211112421 is 12421111223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29942495521 + 2268616900 = 173039^2 + 47630^2 .
It is an emirp because it is prime and its reverse (12421111223) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 32211112421 - 230 = 31137370597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 32211112393 and 32211112402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32211112721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16105556210 + 16105556211.
It is an arithmetic number, because the mean of its divisors is an integer number (16105556211).
Almost surely, 232211112421 is an apocalyptic number.
It is an amenable number.
32211112421 is a deficient number, since it is larger than the sum of its proper divisors (1).
32211112421 is an equidigital number, since it uses as much as digits as its factorization.
32211112421 is an evil number, because the sum of its binary digits is even.
The product of its digits is 192, while the sum is 20.
Adding to 32211112421 its reverse (12421111223), we get a palindrome (44632223644).
The spelling of 32211112421 in words is "thirty-two billion, two hundred eleven million, one hundred twelve thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •