Search a number
-
+
115632274001 = 336293438469
BaseRepresentation
bin110101110110000111…
…0000111101001010001
3102001110121112010210212
41223230032013221101
53343303330232001
6125042024533505
711232322053236
oct1535416075121
9361417463725
10115632274001
1145048449a12
121a4b1021295
13ab9a34440a
14584d22d78d
15301b7e47bb
hex1aec387a51

115632274001 has 4 divisors (see below), whose sum is σ = 115635746100. Its totient is φ = 115628801904.

The previous prime is 115632273947. The next prime is 115632274027. The reversal of 115632274001 is 100472236511.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 38390524225 + 77241749776 = 195935^2 + 277924^2 .

It is a cyclic number.

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

It is a Duffinian number.

It is a Curzon number.

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

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

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

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

Almost surely, 2115632274001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3472098.

The product of its (nonzero) digits is 10080, while the sum is 32.

The spelling of 115632274001 in words is "one hundred fifteen billion, six hundred thirty-two million, two hundred seventy-four thousand, one".

Divisors: 1 33629 3438469 115632274001