Search a number
-
+
106456947 = 343381953
BaseRepresentation
bin1100101100001…
…10011101110011
321102022120110220
412112012131303
5204223110242
614321424123
72431604052
oct626063563
9242276426
10106456947
1155101753
122b79b043
131909479c
14101d2399
15952cbec
hex6586773

106456947 has 8 divisors (see below), whose sum is σ = 142272144. Its totient is φ = 70806528.

The previous prime is 106456919. The next prime is 106456957. The reversal of 106456947 is 749654601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 106456947 - 214 = 106440563 is a prime.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39678 + ... + 42275.

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

Almost surely, 2106456947 is an apocalyptic number.

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

106456947 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 82389.

The product of its (nonzero) digits is 181440, while the sum is 42.

The square root of 106456947 is about 10317.7975847562. The cubic root of 106456947 is about 473.9414239781.

The spelling of 106456947 in words is "one hundred six million, four hundred fifty-six thousand, nine hundred forty-seven".

Divisors: 1 3 433 1299 81953 245859 35485649 106456947