Search a number
-
+
110221010212010 = 2557719102428113
BaseRepresentation
bin11001000011111011010100…
…001010010001010010101010
3112110021000200201020211012212
4121003323110022101102222
5103421330112103241020
61030230455535405122
732134130245363145
oct3103732412212252
9473230621224185
10110221010212010
1132135516899675
12104416a13837a2
134966a4836c639
141d30a2255305c
15cb217c44ecc5
hex643ed42914aa

110221010212010 has 16 divisors (see below), whose sum is σ = 198741662098056. Its totient is φ = 44011994370048.

The previous prime is 110221010212009. The next prime is 110221010212031. The reversal of 110221010212010 is 10212010122011.

It can be written as a sum of positive squares in 4 ways, for example, as 94652643223681 + 15568366988329 = 9728959^2 + 3945677^2 .

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9551208287 + ... + 9551219826.

Almost surely, 2110221010212010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 19102428697.

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

Adding to 110221010212010 its reverse (10212010122011), we get a palindrome (120433020334021).

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

Divisors: 1 2 5 10 577 1154 2885 5770 19102428113 38204856226 95512140565 191024281130 11022101021201 22044202042402 55110505106005 110221010212010