Base | Representation |
---|---|
bin | 1110100011010101000011… |
… | …10111110100100001010101 |
3 | 11012022012011111111110211122 |
4 | 13101222201313310201111 |
5 | 13143242423330320041 |
6 | 152020411001013325 |
7 | 6511640223030431 |
oct | 721524167644125 |
9 | 135265144443748 |
10 | 32000222120021 |
11 | a218244162a01 |
12 | 3709a35784245 |
13 | 14b17b9a03c8c |
14 | 7c8b675399c1 |
15 | 3a75ec52ec4b |
hex | 1d1aa1df4855 |
32000222120021 has 2 divisors, whose sum is σ = 32000222120022. Its totient is φ = 32000222120020.
The previous prime is 32000222119993. The next prime is 32000222120029. The reversal of 32000222120021 is 12002122200023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29365398430225 + 2634823689796 = 5418985^2 + 1623214^2 .
It is a cyclic number.
It is not a de Polignac number, because 32000222120021 - 214 = 32000222103637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32000222120029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16000111060010 + 16000111060011.
It is an arithmetic number, because the mean of its divisors is an integer number (16000111060011).
Almost surely, 232000222120021 is an apocalyptic number.
It is an amenable number.
32000222120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
32000222120021 is an equidigital number, since it uses as much as digits as its factorization.
32000222120021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 32000222120021 its reverse (12002122200023), we get a palindrome (44002344320044).
The spelling of 32000222120021 in words is "thirty-two trillion, two hundred twenty-two million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •