Search a number
-
+
110460150114013 = 726595913417707
BaseRepresentation
bin11001000111011010000010…
…000000100110011011011101
3112111002212221210011112120101
4121013122002000212123131
5103434234341412122023
61030532405321421101
732160324331121500
oct3107320200463335
9474085853145511
10110460150114013
113221798305a517
121047bb0093a791
1349834694a872b
141d3c42a8b1137
15cb84c6b121ad
hex6476820266dd

110460150114013 has 12 divisors (see below), whose sum is σ = 128494692742752. Its totient is φ = 94679957422680.

The previous prime is 110460150113983. The next prime is 110460150114029. The reversal of 110460150114013 is 310411051064011.

It is not a de Polignac number, because 110460150114013 - 229 = 110459613243101 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110460150114113) 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, 30611106 + ... + 34028812.

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

Almost surely, 2110460150114013 is an apocalyptic number.

It is an amenable number.

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

110460150114013 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 1440, while the sum is 28.

The spelling of 110460150114013 in words is "one hundred ten trillion, four hundred sixty billion, one hundred fifty million, one hundred fourteen thousand, thirteen".

Divisors: 1 7 49 659591 3417707 4617137 23923949 32319959 167467643 2254288777837 15780021444859 110460150114013