Search a number
-
+
102211020022 = 251105510011
BaseRepresentation
bin101111100110001000…
…0000110010011110110
3100202211021001210112011
41133030100012103312
53133312010120042
6114542144514434
710245612223006
oct1371420062366
9322737053464
10102211020022
113a390502181
121798631ba1a
13983b8cc007
144d3896a006
1529d33d1a17
hex17cc4064f6

102211020022 has 4 divisors (see below), whose sum is σ = 153316530036. Its totient is φ = 51105510010.

The previous prime is 102211019959. The next prime is 102211020029. The reversal of 102211020022 is 220020112201.

It is a happy number.

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

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (102211020029) by changing a digit.

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

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

Almost surely, 2102211020022 is an apocalyptic number.

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

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

102211020022 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 51105510013.

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

Adding to 102211020022 its reverse (220020112201), we get a palindrome (322231132223).

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

Divisors: 1 2 51105510011 102211020022