Search a number
-
+
101111202102002 = 2172374727915557
BaseRepresentation
bin10110111111010111001001…
…010010001011101011110010
3111021000010200112010001002012
4112333113021102023223302
5101223101220214231002
6555013502304122522
730204020563153301
oct2677271122135362
9437003615101065
10101111202102002
112a243024694204
12b410041006442
13445598c98a831
141ad7b45d58438
15ba5203931d52
hex5bf5c948baf2

101111202102002 has 24 divisors (see below), whose sum is σ = 165467588698884. Its totient is φ = 46295749124352.

The previous prime is 101111202101989. The next prime is 101111202102013. The reversal of 101111202102002 is 200201202111101.

It can be written as a sum of positive squares in 6 ways, for example, as 93736496061121 + 7374706040881 = 9681761^2 + 2715641^2 .

It is an unprimeable number.

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

Almost surely, 2101111202102002 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 16, while the sum is 14.

Adding to 101111202102002 its reverse (200201202111101), we get a palindrome (301312404213103).

Subtracting 101111202102002 from its reverse (200201202111101), we obtain a palindrome (99090000009099).

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

Divisors: 1 2 17 34 37 74 289 578 629 1258 10693 21386 4727915557 9455831114 80374564469 160749128938 174932875609 349865751218 1366367595973 2732735191946 2973858885353 5947717770706 50555601051001 101111202102002