Search a number
-
+
156615055553 = 1129598321293
BaseRepresentation
bin1001000111011011111…
…1000001100011000001
3112222020202212011011002
42101312333001203001
510031221423234203
6155540432101345
714213032002335
oct2216677014301
9488222764132
10156615055553
1160469130310
122642a094855
13119cbbb5808
14781a1457c5
15411970ad88
hex2476fc18c1

156615055553 has 16 divisors (see below), whose sum is σ = 179739950400. Its totient is φ = 135137782080.

The previous prime is 156615055511. The next prime is 156615055561. The reversal of 156615055553 is 355550516651.

It is not a de Polignac number, because 156615055553 - 26 = 156615055489 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4141826 + ... + 4179467.

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

Almost surely, 2156615055553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8321392.

The product of its (nonzero) digits is 1687500, while the sum is 47.

The spelling of 156615055553 in words is "one hundred fifty-six billion, six hundred fifteen million, fifty-five thousand, five hundred fifty-three".

Divisors: 1 11 29 59 319 649 1711 18821 8321293 91534223 241317497 490956287 2654492467 5400519157 14237732323 156615055553