Search a number
-
+
101002200111 = 3219590656141
BaseRepresentation
bin101111000010000110…
…0110100010000101111
3100122201000110101100100
41132010030310100233
53123323030400421
6114222203402143
710203633351501
oct1360414642057
9318630411310
10101002200111
113992012195a
12176a9523353
1396a833a167
144c621c1d71
152962202c26
hex178433442f

101002200111 has 12 divisors (see below), whose sum is σ = 153570596920. Its totient is φ = 63790863120.

The previous prime is 101002200077. The next prime is 101002200121. The reversal of 101002200111 is 111002200101.

It is a happy number.

It is not a de Polignac number, because 101002200111 - 27 = 101002199983 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

It is a congruent number.

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

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

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

Almost surely, 2101002200111 is an apocalyptic number.

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

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

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

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

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

Adding to 101002200111 its reverse (111002200101), we get a palindrome (212004400212).

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

Divisors: 1 3 9 19 57 171 590656141 1771968423 5315905269 11222466679 33667400037 101002200111