Search a number
-
+
110113131210 = 2353670437707
BaseRepresentation
bin110011010001101000…
…0010000101011001010
3101112012222021122012220
41212203100100223022
53301002430144320
6122330230314510
710645464113025
oct1464320205312
9345188248186
10110113131210
1142775aa0285
12194107b8a36
13a4caa8a554
1454882321bc
152ce6ee2e40
hex19a3410aca

110113131210 has 16 divisors (see below), whose sum is σ = 264271514976. Its totient is φ = 29363501648.

The previous prime is 110113131209. The next prime is 110113131229. The reversal of 110113131210 is 12131311011.

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

It is a self number, because there is not a number n which added to its sum of digits gives 110113131210.

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, 1835218824 + ... + 1835218883.

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

Almost surely, 2110113131210 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 3670437717.

The product of its (nonzero) digits is 18, while the sum is 15.

Adding to 110113131210 its reverse (12131311011), we get a palindrome (122244442221).

The spelling of 110113131210 in words is "one hundred ten billion, one hundred thirteen million, one hundred thirty-one thousand, two hundred ten".

Divisors: 1 2 3 5 6 10 15 30 3670437707 7340875414 11011313121 18352188535 22022626242 36704377070 55056565605 110113131210