Search a number
-
+
56715155110 = 2537153284203
BaseRepresentation
bin110100110100011111…
…001001011010100110
312102101120120101200101
4310310133021122212
51412123034430420
642015442334314
74045311602305
oct646437113246
9172346511611
1056715155110
1122064254519
12aba995a39a
13546b052ca3
142a6050043c
15171e19560a
hexd347c96a6

56715155110 has 16 divisors (see below), whose sum is σ = 104846395536. Its totient is φ = 22072925088.

The previous prime is 56715155099. The next prime is 56715155113. The reversal of 56715155110 is 1155151765.

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

It is a Harshad number since it is a multiple of its sum of digits (37).

It is a self number, because there is not a number n which added to its sum of digits gives 56715155110.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (56715155113) 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 7 ways as a sum of consecutive naturals, for example, 76641732 + ... + 76642471.

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

Almost surely, 256715155110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 153284247.

The product of its (nonzero) digits is 26250, while the sum is 37.

The spelling of 56715155110 in words is "fifty-six billion, seven hundred fifteen million, one hundred fifty-five thousand, one hundred ten".

Divisors: 1 2 5 10 37 74 185 370 153284203 306568406 766421015 1532842030 5671515511 11343031022 28357577555 56715155110