Search a number
-
+
113535155150141 = 463924474058019
BaseRepresentation
bin11001110100001001110110…
…100101111001110100111101
3112212222212002011122102201112
4121310021312211321310331
5104340124444204301031
61041245155155251405
732625433661506364
oct3164116645716475
9485885064572645
10113535155150141
11331a2a97254a5a
1210897a598a9b65
134b4741c355bca
1420071b8dd27db
15d1d49b06562b
hex674276979d3d

113535155150141 has 4 divisors (see below), whose sum is σ = 113559629212800. Its totient is φ = 113510681087484.

The previous prime is 113535155150117. The next prime is 113535155150161. The reversal of 113535155150141 is 141051551535311.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-113535155150141 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12237024371 + ... + 12237033648.

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

Almost surely, 2113535155150141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 24474062658.

The product of its (nonzero) digits is 112500, while the sum is 41.

The spelling of 113535155150141 in words is "one hundred thirteen trillion, five hundred thirty-five billion, one hundred fifty-five million, one hundred fifty thousand, one hundred forty-one".

Divisors: 1 4639 24474058019 113535155150141