Search a number
-
+
110013299999 = 3132969107641
BaseRepresentation
bin110011001110101001…
…1011011110100011111
3101111222000102200112122
41212131103123310133
53300301401044444
6122312302453155
710643142422651
oct1463523336437
9344860380478
10110013299999
1142724704649
12193a32941bb
13a4b31a5825
145478c866d1
152cdd3734ee
hex199d4dbd1f

110013299999 has 8 divisors (see below), whose sum is σ = 113566615680. Its totient is φ = 106460265600.

The previous prime is 110013299971. The next prime is 110013300031. The reversal of 110013299999 is 999992310011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 110013299999 - 232 = 105718332703 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110013299999 is an apocalyptic number.

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

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

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

The sum of its prime factors is 140641.

The product of its (nonzero) digits is 354294, while the sum is 53.

The spelling of 110013299999 in words is "one hundred ten billion, thirteen million, two hundred ninety-nine thousand, nine hundred ninety-nine".

Divisors: 1 31 32969 107641 1022039 3336871 3548816129 110013299999