Search a number
-
+
110405200030 = 2520641534883
BaseRepresentation
bin110011011010010101…
…0011010100010011110
3101112222022212021022121
41212310222122202132
53302102212400110
6122415222333154
710655641500436
oct1466452324236
9345868767277
10110405200030
1142905947974
121949258a1ba
13a54643c338
1454b4d3d2c6
152d12986cda
hex19b4a9a89e

110405200030 has 16 divisors (see below), whose sum is σ = 198739359504. Its totient is φ = 44159857920.

The previous prime is 110405200021. The next prime is 110405200049. The reversal of 110405200030 is 30002504011.

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

It is a congruent number.

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 7 ways as a sum of consecutive naturals, for example, 61032 + ... + 473851.

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

Almost surely, 2110405200030 is an apocalyptic number.

110405200030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 555531.

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

Adding to 110405200030 its reverse (30002504011), we get a palindrome (140407704041).

The spelling of 110405200030 in words is "one hundred ten billion, four hundred five million, two hundred thousand, thirty".

Divisors: 1 2 5 10 20641 41282 103205 206410 534883 1069766 2674415 5348830 11040520003 22081040006 55202600015 110405200030