Search a number
-
+
110105005100 = 22521101050051
BaseRepresentation
bin110011010001011000…
…1010000110000101100
3101112012101222210021212
41212202301100300230
53300443340130400
6122325340213552
710645335046526
oct1464261206054
9345171883255
10110105005100
114277144aa92
1219409b3a2b8
13a4c91a38bc
145487118a16
152ce643a335
hex19a2c50c2c

110105005100 has 18 divisors (see below), whose sum is σ = 238927861284. Its totient is φ = 44042002000.

The previous prime is 110105005099. The next prime is 110105005103. The reversal of 110105005100 is 1500501011.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 550524926 + ... + 550525125.

Almost surely, 2110105005100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

Adding to 110105005100 its reverse (1500501011), we get a palindrome (111605506111).

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

Divisors: 1 2 4 5 10 20 25 50 100 1101050051 2202100102 4404200204 5505250255 11010500510 22021001020 27526251275 55052502550 110105005100