Search a number
-
+
102103311022 = 251051655511
BaseRepresentation
bin101111100010111010…
…1001110001010101110
3100202112202101121112221
41133011311032022232
53133101421423042
6114523340145554
710243133552416
oct1370565161256
9322482347487
10102103311022
113a335725879
12179562382ba
1398224b968b
144d2852d646
1529c8c07d67
hex17c5d4e2ae

102103311022 has 4 divisors (see below), whose sum is σ = 153154966536. Its totient is φ = 51051655510.

The previous prime is 102103310999. The next prime is 102103311049. The reversal of 102103311022 is 220113301201.

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

It is a super-2 number, since 2×1021033110222 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2102103311022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 51051655513.

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

Adding to 102103311022 its reverse (220113301201), we get a palindrome (322216612223).

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

Divisors: 1 2 51051655511 102103311022