Search a number
-
+
10770151 = 72219799
BaseRepresentation
bin101001000101…
…011011100111
3202021011212111
4221011123213
510224121101
61022501451
7160354600
oct51053347
922234774
1010770151
116096857
123734887
132301292
141604da7
15e2b251
hexa456e7

10770151 has 6 divisors (see below), whose sum is σ = 12528600. Its totient is φ = 9231516.

The previous prime is 10770121. The next prime is 10770161. The reversal of 10770151 is 15107701.

It is not a de Polignac number, because 10770151 - 29 = 10769639 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 109851 + ... + 109948.

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

Almost surely, 210770151 is an apocalyptic number.

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

10770151 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 219813 (or 219806 counting only the distinct ones).

The product of its (nonzero) digits is 245, while the sum is 22.

The square root of 10770151 is about 3281.7908220970. The cubic root of 10770151 is about 220.8380637727.

Adding to 10770151 its reverse (15107701), we get a palindrome (25877852).

The spelling of 10770151 in words is "ten million, seven hundred seventy thousand, one hundred fifty-one".

Divisors: 1 7 49 219799 1538593 10770151