Search a number
-
+
1255071070 = 251117671161
BaseRepresentation
bin100101011001110…
…1101110101011110
310020110122012211201
41022303231311132
510032244233240
6324312310114
743046633221
oct11263556536
93213565751
101255071070
11594500520
122b03a233a
13170036b06
14bc9875b8
15752b7d9a
hex4acedd5e

1255071070 has 32 divisors (see below), whose sum is σ = 2609477856. Its totient is φ = 429542400.

The previous prime is 1255071029. The next prime is 1255071109. The reversal of 1255071070 is 701705521.

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, 333711 + ... + 337450.

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

Almost surely, 21255071070 is an apocalyptic number.

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

1255071070 is an abundant number, since it is smaller than the sum of its proper divisors (1354406786).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 671196.

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

The square root of 1255071070 is about 35426.9822310622. The cubic root of 1255071070 is about 1078.6720847791.

Adding to 1255071070 its reverse (701705521), we get a palindrome (1956776591).

The spelling of 1255071070 in words is "one billion, two hundred fifty-five million, seventy-one thousand, seventy".

Divisors: 1 2 5 10 11 17 22 34 55 85 110 170 187 374 935 1870 671161 1342322 3355805 6711610 7382771 11409737 14765542 22819474 36913855 57048685 73827710 114097370 125507107 251014214 627535535 1255071070