Search a number
-
+
10151562101 = 471543139981
BaseRepresentation
bin10010111010001010…
…01000101101110101
3222012110221210020112
421131011020231311
5131242244441401
64355155112405
7506364565652
oct113505105565
928173853215
1010151562101
11433a32394a
121b738a2705
13c5a2153a5
146c4336c29
153e634a3bb
hex25d148b75

10151562101 has 8 divisors (see below), whose sum is σ = 10374345984. Its totient is φ = 9929061360.

The previous prime is 10151562097. The next prime is 10151562103. The reversal of 10151562101 is 10126515101.

10151562101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a cyclic number.

It is not a de Polignac number, because 10151562101 - 22 = 10151562097 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 210151562101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 141571.

The product of its (nonzero) digits is 300, while the sum is 23.

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

Divisors: 1 47 1543 72521 139981 6579107 215990683 10151562101