Search a number
-
+
110012112111000 = 233531122379718757
BaseRepresentation
bin11001000000111000110000…
…110111010000010110011000
3112102112001111020121202211210
4121000320300313100112120
5103404414301200023000
61025550511104223120
732113053456666531
oct3100706067202630
9472461436552753
10110012112111000
1132064969305490
121040910190aaa0
13495013672a148
141d248867c3688
15caba02c2b350
hex640e30dd0598

110012112111000 has 512 divisors, whose sum is σ = 376612331397120. Its totient is φ = 26515282176000.

The previous prime is 110012112110963. The next prime is 110012112111001. The reversal of 110012112111000 is 111211210011.

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

It is a Harshad number since it is a multiple of its sum of digits (12).

It is a congruent number.

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

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

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

Almost surely, 2110012112111000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 110012112111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188306165698560).

110012112111000 is an abundant number, since it is smaller than the sum of its proper divisors (266600219286120).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 19812 (or 19798 counting only the distinct ones).

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

Adding to 110012112111000 its reverse (111211210011), we get a palindrome (110123323321011).

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