Base | Representation |
---|---|
bin | 11101110100100010… |
… | …110011000011001001 |
3 | 10001122112101002012021 |
4 | 131310202303003021 |
5 | 1011034113100441 |
6 | 22413152444441 |
7 | 2212325635543 |
oct | 356442630311 |
9 | 101575332167 |
10 | 32020050121 |
11 | 12641535644 |
12 | 6257549721 |
13 | 3033a3c627 |
14 | 179a842693 |
15 | c7614c3d1 |
hex | 7748b30c9 |
32020050121 has 2 divisors, whose sum is σ = 32020050122. Its totient is φ = 32020050120.
The previous prime is 32020050107. The next prime is 32020050191. The reversal of 32020050121 is 12105002023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27952161721 + 4067888400 = 167189^2 + 63780^2 .
It is a cyclic number.
It is not a de Polignac number, because 32020050121 - 27 = 32020049993 is a prime.
It is a super-2 number, since 2×320200501212 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32020050095 and 32020050104.
It is not a weakly prime, because it can be changed into another prime (32020050191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16010025060 + 16010025061.
It is an arithmetic number, because the mean of its divisors is an integer number (16010025061).
Almost surely, 232020050121 is an apocalyptic number.
It is an amenable number.
32020050121 is a deficient number, since it is larger than the sum of its proper divisors (1).
32020050121 is an equidigital number, since it uses as much as digits as its factorization.
32020050121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 16.
Adding to 32020050121 its reverse (12105002023), we get a palindrome (44125052144).
The spelling of 32020050121 in words is "thirty-two billion, twenty million, fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •