Base | Representation |
---|---|
bin | 110111111011101011… |
… | …1110100110111110101 |
3 | 102111000222022102221021 |
4 | 1233313113310313311 |
5 | 3431443232211341 |
6 | 131102455021141 |
7 | 11451355001146 |
oct | 1576727646765 |
9 | 374028272837 |
10 | 120114335221 |
11 | 46a38457941 |
12 | 1b34206a7b1 |
13 | b432aa9a4a |
14 | 5b565c9acd |
15 | 31d003c9d1 |
hex | 1bf75f4df5 |
120114335221 has 2 divisors, whose sum is σ = 120114335222. Its totient is φ = 120114335220.
The previous prime is 120114335203. The next prime is 120114335233. The reversal of 120114335221 is 122533411021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90986086321 + 29128248900 = 301639^2 + 170670^2 .
It is a cyclic number.
It is not a de Polignac number, because 120114335221 - 25 = 120114335189 is a prime.
It is a super-2 number, since 2×1201143352212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120114335281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60057167610 + 60057167611.
It is an arithmetic number, because the mean of its divisors is an integer number (60057167611).
Almost surely, 2120114335221 is an apocalyptic number.
It is an amenable number.
120114335221 is a deficient number, since it is larger than the sum of its proper divisors (1).
120114335221 is an equidigital number, since it uses as much as digits as its factorization.
120114335221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 120114335221 its reverse (122533411021), we get a palindrome (242647746242).
The spelling of 120114335221 in words is "one hundred twenty billion, one hundred fourteen million, three hundred thirty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •