Search a number
-
+
106076252151 = 3279149193041
BaseRepresentation
bin110001011001010100…
…0110010011111110111
3101010210122011221012200
41202302220302133313
53214221010032101
6120421502115543
710443445160232
oct1426250623767
9333718157180
10106076252151
1140a943082a1
121868487bbb3
13a006625a0c
1451c403c419
152b5c8d5986
hex18b2a327f7

106076252151 has 12 divisors (see below), whose sum is σ = 155160763680. Its totient is φ = 69822342720.

The previous prime is 106076252147. The next prime is 106076252207. The reversal of 106076252151 is 151252670601.

106076252151 is a `hidden beast` number, since 1 + 0 + 6 + 0 + 7 + 625 + 21 + 5 + 1 = 666.

It is not a de Polignac number, because 106076252151 - 22 = 106076252147 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2106076252151 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 36.

The spelling of 106076252151 in words is "one hundred six billion, seventy-six million, two hundred fifty-two thousand, one hundred fifty-one".

Divisors: 1 3 9 79 237 711 149193041 447579123 1342737369 11786250239 35358750717 106076252151