Search a number
-
+
102211020122 = 251105510061
BaseRepresentation
bin101111100110001000…
…0000110010101011010
3100202211021001210122212
41133030100012111122
53133312010120442
6114542144515122
710245612223211
oct1371420062532
9322737053585
10102211020122
113a390502262
121798631baa2
13983b8cc083
144d3896a078
1529d33d1a82
hex17cc40655a

102211020122 has 4 divisors (see below), whose sum is σ = 153316530186. Its totient is φ = 51105510060.

The previous prime is 102211020091. The next prime is 102211020157. The reversal of 102211020122 is 221020112201.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 102125624041 + 85396081 = 319571^2 + 9241^2 .

It is a junction number, because it is equal to n+sod(n) for n = 102211020097 and 102211020106.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

Almost surely, 2102211020122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 51105510063.

The product of its (nonzero) digits is 32, while the sum is 14.

Adding to 102211020122 its reverse (221020112201), we get a palindrome (323231132323).

The spelling of 102211020122 in words is "one hundred two billion, two hundred eleven million, twenty thousand, one hundred twenty-two".

Divisors: 1 2 51105510061 102211020122