Search a number
-
+
11012112110 = 251636755897
BaseRepresentation
bin10100100000101111…
…10111111011101110
31001102110020020221002
422100113313323232
5140023100041420
65020415440302
7536614260056
oct122027677356
931373206832
1011012112110
1147410608aa
122173b26092
1310665a868c
14766744566
15446b83075
hex2905f7eee

11012112110 has 16 divisors (see below), whose sum is σ = 19943410896. Its totient is φ = 4377820608.

The previous prime is 11012112011. The next prime is 11012112119. The reversal of 11012112110 is 1121121011.

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

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

It is a congruent number.

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

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

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

Almost surely, 211012112110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 6756067.

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

Adding to 11012112110 its reverse (1121121011), we get a palindrome (12133233121).

The spelling of 11012112110 in words is "eleven billion, twelve million, one hundred twelve thousand, one hundred ten".

Divisors: 1 2 5 10 163 326 815 1630 6755897 13511794 33779485 67558970 1101211211 2202422422 5506056055 11012112110