Search a number
-
+
106451033671 = 2930791192181
BaseRepresentation
bin110001100100011111…
…0011101111001000111
3101011202202101210210201
41203020332131321013
53221002431034141
6120523011031331
710455645566563
oct1431076357107
9334682353721
10106451033671
1141166919194
121876a29b547
13a066177828
14521bb1a6a3
152b80767031
hex18c8f9de47

106451033671 has 8 divisors (see below), whose sum is σ = 110157616800. Its totient is φ = 102746841120.

The previous prime is 106451033629. The next prime is 106451033707. The reversal of 106451033671 is 176330154601.

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

It is a cyclic number.

It is not a de Polignac number, because 106451033671 - 27 = 106451033543 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 2106451033671 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1195289.

The product of its (nonzero) digits is 45360, while the sum is 37.

The spelling of 106451033671 in words is "one hundred six billion, four hundred fifty-one million, thirty-three thousand, six hundred seventy-one".

Divisors: 1 29 3079 89291 1192181 34573249 3670725299 106451033671