Search a number
-
+
10642445151 = 313272883209
BaseRepresentation
bin10011110100101011…
…01101001101011111
31000110200122020012020
421322111231031133
5133243431221101
64520012311223
7524505201612
oct117225551537
930420566166
1010642445151
114571423618
122090172513
131007b27830
1472d5d8179
154244b2136
hex27a56d35f

10642445151 has 8 divisors (see below), whose sum is σ = 15281459760. Its totient is φ = 6549196992.

The previous prime is 10642445147. The next prime is 10642445189. The reversal of 10642445151 is 15154424601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10642445151 - 22 = 10642445147 is a prime.

It is a super-3 number, since 3×106424451513 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136441566 + ... + 136441643.

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

Almost surely, 210642445151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 272883225.

The product of its (nonzero) digits is 19200, while the sum is 33.

Adding to 10642445151 its reverse (15154424601), we get a palindrome (25796869752).

The spelling of 10642445151 in words is "ten billion, six hundred forty-two million, four hundred forty-five thousand, one hundred fifty-one".

Divisors: 1 3 13 39 272883209 818649627 3547481717 10642445151