[go: up one dir, main page]

Search a number
-
+
101990567 = 716389387
BaseRepresentation
bin1100001010001…
…00000010100111
321002220122202102
412011010002213
5202102144232
614042002315
72345622410
oct605040247
9232818672
10101990567
1152631028
122a1a639b
131818c863
14d78c807
158e49662
hex61440a7

101990567 has 8 divisors (see below), whose sum is σ = 117277056. Its totient is φ = 86883192.

The previous prime is 101990557. The next prime is 101990591. The reversal of 101990567 is 765099101.

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 101990567 - 28 = 101990311 is a prime.

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 101990567.

It is a congruent number.

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

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

Almost surely, 2101990567 is an apocalyptic number.

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

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

101990567 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 89557.

The product of its (nonzero) digits is 17010, while the sum is 38.

The square root of 101990567 is about 10099.0379244758. The cubic root of 101990567 is about 467.2184690984.

The spelling of 101990567 in words is "one hundred one million, nine hundred ninety thousand, five hundred sixty-seven".

Divisors: 1 7 163 1141 89387 625709 14570081 101990567