Search a number
-
+
109110200002 = 273747330137
BaseRepresentation
bin110010110011101111…
…0011000011011000010
3101102122002002110020121
41211213132120123002
53241424202400002
6122042522130454
710611565253236
oct1454736303302
9342562073217
10109110200002
1142300955211
1219190950a2a
13a39b06512b
1453d0d605c6
152c88e33237
hex19677986c2

109110200002 has 8 divisors (see below), whose sum is σ = 165907290636. Its totient is φ = 53807769792.

The previous prime is 109110199963. The next prime is 109110200011. The reversal of 109110200002 is 200002011901.

It can be written as a sum of positive squares in 2 ways, for example, as 108569591001 + 540609001 = 329499^2 + 23251^2 .

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

It is a super-3 number, since 3×1091102000023 (a number of 34 digits) contains 333 as substring.

It is an unprimeable number.

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

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

Almost surely, 2109110200002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 747330212.

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

Adding to 109110200002 its reverse (200002011901), we get a palindrome (309112211903).

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

Divisors: 1 2 73 146 747330137 1494660274 54555100001 109110200002