Base | Representation |
---|---|
bin | 110111111011010011… |
… | …0100110001101110101 |
3 | 102111000002000210111001 |
4 | 1233312212212031311 |
5 | 3431431431231013 |
6 | 131101314243301 |
7 | 11451140212036 |
oct | 1576646461565 |
9 | 374002023431 |
10 | 120101430133 |
11 | 46a31143083 |
12 | 1b339886531 |
13 | b43020bab9 |
14 | 5b549caa8d |
15 | 31cdd3dddd |
hex | 1bf69a6375 |
120101430133 has 2 divisors, whose sum is σ = 120101430134. Its totient is φ = 120101430132.
The previous prime is 120101430101. The next prime is 120101430149. The reversal of 120101430133 is 331034101021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105039513604 + 15061916529 = 324098^2 + 122727^2 .
It is a cyclic number.
It is not a de Polignac number, because 120101430133 - 25 = 120101430101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120101430133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120101230133) 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, 60050715066 + 60050715067.
It is an arithmetic number, because the mean of its divisors is an integer number (60050715067).
Almost surely, 2120101430133 is an apocalyptic number.
It is an amenable number.
120101430133 is a deficient number, since it is larger than the sum of its proper divisors (1).
120101430133 is an equidigital number, since it uses as much as digits as its factorization.
120101430133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 120101430133 its reverse (331034101021), we get a palindrome (451135531154).
The spelling of 120101430133 in words is "one hundred twenty billion, one hundred one million, four hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •