Search a number
-
+
102001110101 = 1121944367599
BaseRepresentation
bin101111011111110111…
…1010110110001010101
3100202021122002021020122
41132333233112301111
53132344241010401
6114505245441325
710240453062512
oct1367757266125
9322248067218
10102001110101
113a292a70800
1217927b70245
139807285167
144d18b28309
1529bec6b21b
hex17bfbd6c55

102001110101 has 12 divisors (see below), whose sum is σ = 118017816000. Its totient is φ = 87847844040.

The previous prime is 102001110089. The next prime is 102001110131. The reversal of 102001110101 is 101011100201.

It is a happy number.

It is not a de Polignac number, because 102001110101 - 26 = 102001110037 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22181501 + ... + 22186098.

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

Almost surely, 2102001110101 is an apocalyptic number.

102001110101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 44367640 (or 44367629 counting only the distinct ones).

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

Adding to 102001110101 its reverse (101011100201), we get a palindrome (203012210302).

The spelling of 102001110101 in words is "one hundred two billion, one million, one hundred ten thousand, one hundred one".

Divisors: 1 11 19 121 209 2299 44367599 488043589 842984381 5368479479 9272828191 102001110101