Search a number
-
+
110010212200102 = 2531037832190567
BaseRepresentation
bin11001000000110110111111…
…100111101010111010100110
3112102111212120211121022001111
4121000312333213222322212
5103404401403310400402
61025545554354415234
732112655420010644
oct3100667747527246
9472455524538044
10110010212200102
1132064083910295
121040887159151a
13494cbc2c28006
141d24746340194
15cab9410399d7
hex640dbf9eaea6

110010212200102 has 8 divisors (see below), whose sum is σ = 168128814872016. Its totient is φ = 53967273909432.

The previous prime is 110010212200081. The next prime is 110010212200127. The reversal of 110010212200102 is 201002212010011.

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

It is a super-2 number, since 2×1100102122001022 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

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, 518916095178 + ... + 518916095389.

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

Almost surely, 2110010212200102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1037832190622.

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

Adding to 110010212200102 its reverse (201002212010011), we get a palindrome (311012424210113).

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

Divisors: 1 2 53 106 1037832190567 2075664381134 55005106100051 110010212200102