Search a number
-
+
10260707151 = 379108739829
BaseRepresentation
bin10011000111001010…
…11111011101001111
3222111002022221002210
421203211133131033
5132003220112101
64414054321503
7512161400052
oct114345373517
928432287083
1010260707151
1143959a1172
121ba4359293
13c76a0b566
146d4a28a99
15400c097d6
hex26395f74f

10260707151 has 16 divisors (see below), whose sum is σ = 13867212800. Its totient is φ = 6747500448.

The previous prime is 10260707147. The next prime is 10260707159. The reversal of 10260707151 is 15170706201.

It is not a de Polignac number, because 10260707151 - 22 = 10260707147 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10260707159) 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, 237705 + ... + 277533.

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

Almost surely, 210260707151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 40998.

The product of its (nonzero) digits is 2940, while the sum is 30.

The spelling of 10260707151 in words is "ten billion, two hundred sixty million, seven hundred seven thousand, one hundred fifty-one".

Divisors: 1 3 79 237 1087 3261 39829 85873 119487 257619 3146491 9439473 43294123 129882369 3420235717 10260707151