Search a number
-
+
110166016215052 = 2273934500579109
BaseRepresentation
bin11001000011001000000110…
…010000110100100000001100
3112110001202202002100022122201
4121003020012100310200030
5103414430000122340202
61030145322535251244
732130142403204410
oct3103100620644014
9473052662308581
10110166016215052
1132114166149806
1210432ab3b19b24
1349617c2a93535
141d2c0c6884d40
15cb0a0e43c387
hex64320643480c

110166016215052 has 12 divisors (see below), whose sum is σ = 220332032430160. Its totient is φ = 47214006949296.

The previous prime is 110166016215049. The next prime is 110166016215061. The reversal of 110166016215052 is 250512610661011.

110166016215052 is an admirable number.

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

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, 1967250289527 + ... + 1967250289582.

Almost surely, 2110166016215052 is an apocalyptic number.

It is an amenable number.

110166016215052 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 3934500579120 (or 3934500579118 counting only the distinct ones).

The product of its (nonzero) digits is 21600, while the sum is 37.

Adding to 110166016215052 its reverse (250512610661011), we get a palindrome (360678626876063).

The spelling of 110166016215052 in words is "one hundred ten trillion, one hundred sixty-six billion, sixteen million, two hundred fifteen thousand, fifty-two".

Divisors: 1 2 4 7 14 28 3934500579109 7869001158218 15738002316436 27541504053763 55083008107526 110166016215052