Search a number
-
+
101110002100102 = 250555001050051
BaseRepresentation
bin10110111111010110000001…
…110000100010011110000110
3111021000000120220002121221101
4112333112001300202132012
5101223041241014200402
6555013143240010314
730203646052256422
oct2677260160423606
9437000526077841
10101110002100102
112a242569286aa6
12b40b96716099a
13445582b195538
141ad7a70827b82
15ba51833e5b87
hex5bf581c22786

101110002100102 has 4 divisors (see below), whose sum is σ = 151665003150156. Its totient is φ = 50555001050050.

The previous prime is 101110002100097. The next prime is 101110002100183. The reversal of 101110002100102 is 201001200011101.

It is a semiprime because it is the product of two primes.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25277500525024 + ... + 25277500525027.

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

Almost surely, 2101110002100102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50555001050053.

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

Adding to 101110002100102 its reverse (201001200011101), we get a palindrome (302111202111203).

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

Divisors: 1 2 50555001050051 101110002100102