Search a number
-
+
120120011000053 is a prime number
BaseRepresentation
bin11011010011111110011110…
…100101100000100011110101
3120202022100202002122111200021
4123103332132211200203311
5111221021240304000203
61103250212105045141
734205245564642531
oct3323763645404365
9522270662574607
10120120011000053
1135301679761889
12115800907867b1
135204364995b3c
142193ba7a3abc1
15dd48e55805bd
hex6d3f9e9608f5

120120011000053 has 2 divisors, whose sum is σ = 120120011000054. Its totient is φ = 120120011000052.

The previous prime is 120120010999997. The next prime is 120120011000057. The reversal of 120120011000053 is 350000110021021.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88025995835089 + 32094015164964 = 9382217^2 + 5665158^2 .

It is a cyclic number.

It is not a de Polignac number, because 120120011000053 - 213 = 120120010991861 is a prime.

It is a super-3 number, since 3×1201200110000533 (a number of 43 digits) contains 333 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (120120011000057) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60060005500026 + 60060005500027.

It is an arithmetic number, because the mean of its divisors is an integer number (60060005500027).

Almost surely, 2120120011000053 is an apocalyptic number.

It is an amenable number.

120120011000053 is a deficient number, since it is larger than the sum of its proper divisors (1).

120120011000053 is an equidigital number, since it uses as much as digits as its factorization.

120120011000053 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 60, while the sum is 16.

Adding to 120120011000053 its reverse (350000110021021), we get a palindrome (470120121021074).

The spelling of 120120011000053 in words is "one hundred twenty trillion, one hundred twenty billion, eleven million, fifty-three", and thus it is an aban number.