Search a number
-
+
102001320022 = 27311471159773
BaseRepresentation
bin101111011111111000…
…0001010000001010110
3100202021122110221012111
41132333300022001112
53132344314220042
6114505254141234
710240454625520
oct1367760120126
9322248427174
10102001320022
113a2930a4498
121792805181a
139807329884
144d18b80a10
1529becad517
hex17bfc0a056

102001320022 has 32 divisors (see below), whose sum is σ = 180623867904. Its totient is φ = 42275671200.

The previous prime is 102001320017. The next prime is 102001320041. The reversal of 102001320022 is 220023100201.

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

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 558528 + ... + 718300.

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

Almost surely, 2102001320022 is an apocalyptic number.

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

102001320022 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 161284.

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

Adding to 102001320022 its reverse (220023100201), we get a palindrome (322024420223).

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

Divisors: 1 2 7 14 31 62 217 434 1471 2942 10297 20594 45601 91202 159773 319207 319546 638414 1118411 2236822 4952963 9905926 34670741 69341482 235026083 470052166 1645182581 3290365162 7285808573 14571617146 51000660011 102001320022