Search a number
-
+
106455950 = 2522129119
BaseRepresentation
bin1100101100001…
…10001110001110
321102022112002222
412112012032032
5204223042300
614321415342
72431601126
oct626061616
9242275088
10106455950
1155100a27
122b79a552
13190941b3
14101d1c86
15952c785
hex658638e

106455950 has 12 divisors (see below), whose sum is σ = 198008160. Its totient is φ = 42582360.

The previous prime is 106455931. The next prime is 106455977. The reversal of 106455950 is 59554601.

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

It is a self number, because there is not a number n which added to its sum of digits gives 106455950.

It is a congruent number.

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 1064510 + ... + 1064609.

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

Almost surely, 2106455950 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 35.

The square root of 106455950 is about 10317.7492700685. The cubic root of 106455950 is about 473.9399444408.

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

Divisors: 1 2 5 10 25 50 2129119 4258238 10645595 21291190 53227975 106455950