Search a number
-
+
10151300151 = 321766348367
BaseRepresentation
bin10010111010001000…
…01000110000110111
3222012110110110220200
421131010020300313
5131242213101101
64355145331543
7506362425156
oct113504106067
928173413820
1010151300151
11433a165063
121b73796bb3
13c5a1530a5
146c42a959d
153e62e7986
hex25d108c37

10151300151 has 12 divisors (see below), whose sum is σ = 15525518112. Its totient is φ = 6369443136.

The previous prime is 10151300147. The next prime is 10151300153. The reversal of 10151300151 is 15100315101.

10151300151 is a `hidden beast` number, since 1 + 0 + 1 + 513 + 0 + 0 + 151 = 666.

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

It is not a de Polignac number, because 10151300151 - 22 = 10151300147 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33174031 + ... + 33174336.

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

Almost surely, 210151300151 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 75, while the sum is 18.

Adding to 10151300151 its reverse (15100315101), we get a palindrome (25251615252).

The spelling of 10151300151 in words is "ten billion, one hundred fifty-one million, three hundred thousand, one hundred fifty-one".

Divisors: 1 3 9 17 51 153 66348367 199045101 597135303 1127922239 3383766717 10151300151