Search a number
-
+
10222011110 = 256719976667
BaseRepresentation
bin10011000010100011…
…11000001011100110
3222101101111222010002
421201101320023212
5131413313323420
64410153101302
7511211442443
oct114121701346
928341458102
1010222011110
114376071273
121b933b7832
13c6b9b03ac
146cd8349ca
153ec614075
hex2614782e6

10222011110 has 32 divisors (see below), whose sum is σ = 18768326400. Its totient is φ = 4007485152.

The previous prime is 10222011097. The next prime is 10222011113. The reversal of 10222011110 is 1111022201.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10222011113) by changing a digit.

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

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

Almost surely, 210222011110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 76940.

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 10222011110 its reverse (1111022201), we get a palindrome (11333033311).

The spelling of 10222011110 in words is "ten billion, two hundred twenty-two million, eleven thousand, one hundred ten".

Divisors: 1 2 5 10 67 134 199 335 398 670 995 1990 13333 26666 66665 76667 133330 153334 383335 766670 5136689 10273378 15256733 25683445 30513466 51366890 76283665 152567330 1022201111 2044402222 5111005555 10222011110