Search a number
-
+
100120111022 = 250060055511
BaseRepresentation
bin101110100111110011…
…1111010011110101110
3100120102112122121121002
41131033213322132232
53120021222023042
6113554453240302
710143032621261
oct1351747723656
9316375577532
10100120111022
1139508213308
12174a2033092
139597675059
144bbada8cd8
15290ea63132
hex174f9fa7ae

100120111022 has 4 divisors (see below), whose sum is σ = 150180166536. Its totient is φ = 50060055510.

The previous prime is 100120111019. The next prime is 100120111103. The reversal of 100120111022 is 220111021001.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2100120111022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50060055513.

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

Adding to 100120111022 its reverse (220111021001), we get a palindrome (320231132023).

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

Divisors: 1 2 50060055511 100120111022