Base | Representation |
---|---|
bin | 110111111011010100… |
… | …0110111000000110101 |
3 | 102111000010010221001021 |
4 | 1233312220313000311 |
5 | 3431432104220341 |
6 | 131101335101141 |
7 | 11451145232125 |
oct | 1576650670065 |
9 | 374003127037 |
10 | 120102023221 |
11 | 46a31508734 |
12 | 1b339b117b1 |
13 | b430388a3b |
14 | 5b54b02c85 |
15 | 31cde099d1 |
hex | 1bf6a37035 |
120102023221 has 2 divisors, whose sum is σ = 120102023222. Its totient is φ = 120102023220.
The previous prime is 120102023213. The next prime is 120102023257. The reversal of 120102023221 is 122320201021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67654611025 + 52447412196 = 260105^2 + 229014^2 .
It is an emirp because it is prime and its reverse (122320201021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120102023221 - 23 = 120102023213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120102023195 and 120102023204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120102024221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60051011610 + 60051011611.
It is an arithmetic number, because the mean of its divisors is an integer number (60051011611).
Almost surely, 2120102023221 is an apocalyptic number.
It is an amenable number.
120102023221 is a deficient number, since it is larger than the sum of its proper divisors (1).
120102023221 is an equidigital number, since it uses as much as digits as its factorization.
120102023221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 120102023221 its reverse (122320201021), we get a palindrome (242422224242).
The spelling of 120102023221 in words is "one hundred twenty billion, one hundred two million, twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •