Search a number
-
+
106562651450 = 2522131253029
BaseRepresentation
bin110001100111110100…
…0010000010100111010
3101012001112102120121112
41203033220100110322
53221220014321300
6120542035240322
710461502410053
oct1431750202472
9335045376545
10106562651450
1141213925292
121879b7490a2
13a083328358
14522c89372a
152b8a463e35
hex18cfa1053a

106562651450 has 12 divisors (see below), whose sum is σ = 198206531790. Its totient is φ = 42625060560.

The previous prime is 106562651449. The next prime is 106562651513. The reversal of 106562651450 is 54156265601.

It can be written as a sum of positive squares in 3 ways, for example, as 97217369209 + 9345282241 = 311797^2 + 96671^2 .

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

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1065626465 + ... + 1065626564.

Almost surely, 2106562651450 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 216000, while the sum is 41.

The spelling of 106562651450 in words is "one hundred six billion, five hundred sixty-two million, six hundred fifty-one thousand, four hundred fifty".

Divisors: 1 2 5 10 25 50 2131253029 4262506058 10656265145 21312530290 53281325725 106562651450