Search a number
-
+
106422124533 = 3234115153371
BaseRepresentation
bin110001100011101000…
…0001011111111110101
3101011200202000001220220
41203013100023333311
53220423030441113
6120520055244553
710455145063434
oct1430720137765
9334622001826
10106422124533
114115157333a
1218760679759
13a06019522a
145217d5311b
152b7ce56523
hex18c740bff5

106422124533 has 8 divisors (see below), whose sum is σ = 141956788896. Its totient is φ = 70917771600.

The previous prime is 106422124513. The next prime is 106422124583. The reversal of 106422124533 is 335421224601.

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

It is not a de Polignac number, because 106422124533 - 26 = 106422124469 is a prime.

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

It is a Curzon number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (106422124513) 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, 7569663 + ... + 7583708.

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

Almost surely, 2106422124533 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15155715.

The product of its (nonzero) digits is 34560, while the sum is 33.

The spelling of 106422124533 in words is "one hundred six billion, four hundred twenty-two million, one hundred twenty-four thousand, five hundred thirty-three".

Divisors: 1 3 2341 7023 15153371 45460113 35474041511 106422124533