Search a number
-
+
100200011102002 = 277157143650143
BaseRepresentation
bin10110110010000110100010…
…000100010111011100110010
3111010210000202001111020212101
4112302012202010113130302
5101113134110320231002
6553035125530451014
730051132453355510
oct2662064204273462
9433700661436771
10100200011102002
1129a2164a070489
12b2a3524b93a6a
1343baa88851446
141aa59c65834b0
15b8b673bd8587
hex5b21a2117732

100200011102002 has 8 divisors (see below), whose sum is σ = 171771447603456. Its totient is φ = 42942861900852.

The previous prime is 100200011101937. The next prime is 100200011102039. The reversal of 100200011102002 is 200201110002001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a self number, because there is not a number n which added to its sum of digits gives 100200011102002.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3578571825058 + ... + 3578571825085.

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

Almost surely, 2100200011102002 is an apocalyptic number.

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

100200011102002 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 7157143650152.

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

Adding to 100200011102002 its reverse (200201110002001), we get a palindrome (300401121104003).

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

Divisors: 1 2 7 14 7157143650143 14314287300286 50100005551001 100200011102002