Search a number
-
+
106455530 = 25174314563
BaseRepresentation
bin1100101100001…
…10000111101010
321102022111112102
412112012013222
5204223034110
614321413402
72431566656
oct626060752
9242274472
10106455530
1155100685
122b79a262
1319093c4c
14101d1a66
15952c5a5
hex65861ea

106455530 has 32 divisors (see below), whose sum is σ = 207624384. Its totient is φ = 39142656.

The previous prime is 106455521. The next prime is 106455533. The reversal of 106455530 is 35554601.

It is a super-2 number, since 2×1064555302 = 22665559735161800, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 106455493 and 106455502.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29 + ... + 14591.

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

Almost surely, 2106455530 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 14630.

The product of its (nonzero) digits is 9000, while the sum is 29.

The square root of 106455530 is about 10317.7289167723. The cubic root of 106455530 is about 473.9393211625.

The spelling of 106455530 in words is "one hundred six million, four hundred fifty-five thousand, five hundred thirty".

Divisors: 1 2 5 10 17 34 43 85 86 170 215 430 731 1462 3655 7310 14563 29126 72815 145630 247571 495142 626209 1237855 1252418 2475710 3131045 6262090 10645553 21291106 53227765 106455530