Search a number
-
+
115652200051 = 271961216949
BaseRepresentation
bin110101110110101101…
…0001000011001110011
3102001112000000111012201
41223231122020121303
53343323430400201
6125044020004031
711232653323543
oct1535532103163
9361460014181
10115652200051
1145058719723
121a4b7830617
13aba14ccc8b
145851b39323
15301d42d801
hex1aed688673

115652200051 has 8 divisors (see below), whose sum is σ = 115730288000. Its totient is φ = 115574143680.

The previous prime is 115652200019. The next prime is 115652200057. The reversal of 115652200051 is 150002256511.

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 115652200051 - 25 = 115652200019 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2115652200051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15789.

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

Adding to 115652200051 its reverse (150002256511), we get a palindrome (265654456562).

The spelling of 115652200051 in words is "one hundred fifteen billion, six hundred fifty-two million, two hundred thousand, fifty-one".

Divisors: 1 2719 6121 6949 16642999 18894331 42534829 115652200051