Search a number
-
+
110111000013 = 3271747793651
BaseRepresentation
bin110011010001100100…
…0001000010111001101
3101112012211021100202200
41212203020020113031
53301001404000023
6122330112512113
710645440025440
oct1464310102715
9345184240680
10110111000013
1142774875063
121940bb4b639
13a4ca4c24a1
145487c39657
152ce6c21743
hex19a32085cd

110111000013 has 12 divisors (see below), whose sum is σ = 181770539808. Its totient is φ = 62920571400.

The previous prime is 110111000011. The next prime is 110111000023. The reversal of 110111000013 is 310000111011.

It is not a de Polignac number, because 110111000013 - 21 = 110111000011 is a prime.

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 873896763 + ... + 873896888.

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

Almost surely, 2110111000013 is an apocalyptic number.

It is an amenable number.

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

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

110111000013 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 3, while the sum is 9.

Adding to 110111000013 its reverse (310000111011), we get a palindrome (420111111024).

The spelling of 110111000013 in words is "one hundred ten billion, one hundred eleven million, thirteen", and thus it is an aban number.

Divisors: 1 3 7 9 21 63 1747793651 5243380953 12234555557 15730142859 36703666671 110111000013