Search a number
-
+
15780087027051 = 314276533684389
BaseRepresentation
bin1110010110100001011001…
…1110110101010101101011
32001212120011101201021122120
43211220112132311111223
54032020104234331201
653321134421522323
73216034160415654
oct345502636652553
961776141637576
1015780087027051
11503432a816a36
12192a3532733a3
138a6095842209
143c7a9032a52b
151c572267b536
hexe5a167b556b

15780087027051 has 8 divisors (see below), whose sum is σ = 21040136484240. Its totient is φ = 10520047793952.

The previous prime is 15780087027037. The next prime is 15780087027167. The reversal of 15780087027051 is 15072078008751.

It is a happy number.

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

It is not a de Polignac number, because 15780087027051 - 213 = 15780087018859 is a prime.

It is a super-2 number, since 2×157800870270512 (a number of 27 digits) contains 22 as substring.

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

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

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

Almost surely, 215780087027051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5112045.

The product of its (nonzero) digits is 1097600, while the sum is 51.

The spelling of 15780087027051 in words is "fifteen trillion, seven hundred eighty billion, eighty-seven million, twenty-seven thousand, fifty-one".

Divisors: 1 3 1427653 3684389 4282959 11053167 5260029009017 15780087027051