Search a number
-
+
1056025156215 = 35471497908023
BaseRepresentation
bin11110101111000000000…
…00010001101001110111
310201221210012122020121210
433113200000101221313
5114300214414444330
62125044204012503
7136203200502621
oct17274000215167
93657705566553
101056025156215
11377948740a97
121507b8831133
13787763a1653
143917d053c11
151c70a0628b0
hexf5e0011a77

1056025156215 has 16 divisors (see below), whose sum is σ = 1725590043648. Its totient is φ = 551230152096.

The previous prime is 1056025156139. The next prime is 1056025156247. The reversal of 1056025156215 is 5126515206501.

It is not a de Polignac number, because 1056025156215 - 28 = 1056025155959 is a prime.

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

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 748953307 + ... + 748954716.

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

Almost surely, 21056025156215 is an apocalyptic number.

1056025156215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1497908078.

The product of its (nonzero) digits is 90000, while the sum is 39.

The spelling of 1056025156215 in words is "one trillion, fifty-six billion, twenty-five million, one hundred fifty-six thousand, two hundred fifteen".

Divisors: 1 3 5 15 47 141 235 705 1497908023 4493724069 7489540115 22468620345 70401677081 211205031243 352008385405 1056025156215