Base | Representation |
---|---|
bin | 110111111110010111… |
… | …1001000100001111101 |
3 | 102111021020122201010012 |
4 | 1233330233020201331 |
5 | 3432134302044013 |
6 | 131115431553005 |
7 | 11453526645665 |
oct | 1577457104175 |
9 | 374236581105 |
10 | 120204331133 |
11 | 46a84236127 |
12 | 1b36822b765 |
13 | b448629b73 |
14 | 5b645351a5 |
15 | 31d7db81a8 |
hex | 1bfcbc887d |
120204331133 has 2 divisors, whose sum is σ = 120204331134. Its totient is φ = 120204331132.
The previous prime is 120204331127. The next prime is 120204331157. The reversal of 120204331133 is 331133402021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70438752409 + 49765578724 = 265403^2 + 223082^2 .
It is a cyclic number.
It is not a de Polignac number, because 120204331133 - 210 = 120204330109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120204331099 and 120204331108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120204331183) 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, 60102165566 + 60102165567.
It is an arithmetic number, because the mean of its divisors is an integer number (60102165567).
Almost surely, 2120204331133 is an apocalyptic number.
It is an amenable number.
120204331133 is a deficient number, since it is larger than the sum of its proper divisors (1).
120204331133 is an equidigital number, since it uses as much as digits as its factorization.
120204331133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 120204331133 its reverse (331133402021), we get a palindrome (451337733154).
The spelling of 120204331133 in words is "one hundred twenty billion, two hundred four million, three hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •