Search a number
-
+
102001111122 = 2317000185187
BaseRepresentation
bin101111011111110111…
…1010111000001010010
3100202021122002022122110
41132333233113001102
53132344241023442
6114505245450150
710240453065501
oct1367757270122
9322248068573
10102001111122
113a292a71549
1217927b70956
139807285771
144d18b28838
1529bec6b69c
hex17bfbd7052

102001111122 has 8 divisors (see below), whose sum is σ = 204002222256. Its totient is φ = 34000370372.

The previous prime is 102001111099. The next prime is 102001111153. The reversal of 102001111122 is 221111100201.

It is a sphenic number, since it is the product of 3 distinct primes.

102001111122 is an admirable number.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8500092588 + ... + 8500092599.

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

Almost surely, 2102001111122 is an apocalyptic number.

102001111122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 17000185192.

The product of its (nonzero) digits is 8, while the sum is 12.

Adding to 102001111122 its reverse (221111100201), we get a palindrome (323112211323).

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

Divisors: 1 2 3 6 17000185187 34000370374 51000555561 102001111122