Search a number
-
+
10000002210111 = 323730030036667
BaseRepresentation
bin1001000110000100111010…
…0101000101100100111111
31022101222202100101112112100
42101201032211011210333
52302320001031210421
633133534304240143
72051322243210624
oct221411645054477
938358670345470
1010000002210111
113205a82603561
121156098610053
13576cc4750494
1426800754634b
151251ca22cc26
hex9184e94593f

10000002210111 has 12 divisors (see below), whose sum is σ = 14834838113992. Its totient is φ = 6486487919856.

The previous prime is 10000002210073. The next prime is 10000002210131. The reversal of 10000002210111 is 11101220000001.

It is a happy number.

It is not a de Polignac number, because 10000002210111 - 215 = 10000002177343 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 = 10000002210093 and 10000002210102.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10000002210131) 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, 15015018001 + ... + 15015018666.

Almost surely, 210000002210111 is an apocalyptic number.

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

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

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

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

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

Adding to 10000002210111 its reverse (11101220000001), we get a palindrome (21101222210112).

The spelling of 10000002210111 in words is "ten trillion, two million, two hundred ten thousand, one hundred eleven".

Divisors: 1 3 9 37 111 333 30030036667 90090110001 270270330003 1111111356679 3333334070037 10000002210111