Search a number
-
+
102001100211 = 3211333455579
BaseRepresentation
bin101111011111110111…
…1010100010110110011
3100202021122001202200100
41132333233110112303
53132344240201321
6114505245323443
710240453021623
oct1367757242663
9322248052610
10102001100211
113a292a6432a
1217927b66583
1398072807ca
144d18b24883
1529bec68326
hex17bfbd45b3

102001100211 has 6 divisors (see below), whose sum is σ = 147334922540. Its totient is φ = 68000733468.

The previous prime is 102001100209. The next prime is 102001100237. The reversal of 102001100211 is 112001100201.

It is a happy number.

It is not a de Polignac number, because 102001100211 - 21 = 102001100209 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11333455579 = 102001100211 / (1 + 0 + 2 + 0 + 0 + 1 + 1 + 0 + 0 + 2 + 1 + 1).

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5666727781 + ... + 5666727798.

Almost surely, 2102001100211 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 102001100211 its reverse (112001100201), we get a palindrome (214002200412).

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

Divisors: 1 3 9 11333455579 34000366737 102001100211