Search a number
-
+
106000505505 = 325294361173179
BaseRepresentation
bin110001010111000011…
…1110101101010100001
3101010121100122121100100
41202232013311222201
53214042112134010
6120410154413013
710441535300436
oct1425607655241
9333540577310
10106000505505
1140a55581764
1218663431169
139cc3a2460b
1451b7d61b8d
152b55e222c0
hex18ae1f5aa1

106000505505 has 192 divisors, whose sum is σ = 199931846400. Its totient is φ = 51846359040.

The previous prime is 106000505477. The next prime is 106000505509. The reversal of 106000505505 is 505505000601.

106000505505 is a `hidden beast` number, since 1 + 0 + 60 + 0 + 0 + 50 + 550 + 5 = 666.

It is not a de Polignac number, because 106000505505 - 25 = 106000505473 is a prime.

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

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

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 592181506 + ... + 592181684.

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

Almost surely, 2106000505505 is an apocalyptic number.

106000505505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 3750, while the sum is 27.

The spelling of 106000505505 in words is "one hundred six billion, five hundred five thousand, five hundred five".