Search a number
-
+
106321457599 = 7101150383957
BaseRepresentation
bin110001100000101000…
…0001011000110111111
3101011102201120122211221
41203001100023012333
53220221243120344
6120502101454211
710452513323020
oct1430120130677
9334381518757
10106321457599
11410aa766825
1218732a11367
13a045379cb6
14520882ac47
152b741be184
hex18c140b1bf

106321457599 has 8 divisors (see below), whose sum is σ = 122713309728. Its totient is φ = 90230373600.

The previous prime is 106321457581. The next prime is 106321457621. The reversal of 106321457599 is 995754123601.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-106321457599 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 2106321457599 is an apocalyptic number.

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

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

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

The sum of its prime factors is 150384065.

The product of its (nonzero) digits is 2041200, while the sum is 52.

The spelling of 106321457599 in words is "one hundred six billion, three hundred twenty-one million, four hundred fifty-seven thousand, five hundred ninety-nine".

Divisors: 1 7 101 707 150383957 1052687699 15188779657 106321457599