Search a number
-
+
110550510010 = 2519363239059
BaseRepresentation
bin110011011110101010…
…0101110100110111010
3101120100110021210010201
41212331110232212322
53302401412310020
6122441453032414
710662354554623
oct1467524564672
9346313253121
10110550510010
114297a976466
121951318570a
13a56a588585
1454ca366a4a
152d205dba0a
hex19bd52e9ba

110550510010 has 32 divisors (see below), whose sum is σ = 200075676480. Its totient is φ = 43979271168.

The previous prime is 110550510001. The next prime is 110550510053. The reversal of 110550510010 is 10015055011.

It is a happy number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 110550510010.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12198861 + ... + 12207919.

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

Almost surely, 2110550510010 is an apocalyptic number.

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

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

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

110550510010 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 15582.

The product of its (nonzero) digits is 125, while the sum is 19.

Adding to 110550510010 its reverse (10015055011), we get a palindrome (120565565021).

The spelling of 110550510010 in words is "one hundred ten billion, five hundred fifty million, five hundred ten thousand, ten".

Divisors: 1 2 5 10 193 386 965 1930 6323 9059 12646 18118 31615 45295 63230 90590 1220339 1748387 2440678 3496774 6101695 8741935 12203390 17483870 57280057 114560114 286400285 572800570 11055051001 22110102002 55275255005 110550510010