Search a number
-
+
369127 = 11231459
BaseRepresentation
bin1011010000111100111
3200202100101
41122013213
543303002
611524531
73065113
oct1320747
9622311
10369127
11232370
12159747
13cc025
1498743
1574587
hex5a1e7

369127 has 8 divisors (see below), whose sum is σ = 420480. Its totient is φ = 320760.

The previous prime is 369119. The next prime is 369133. The reversal of 369127 is 721963.

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

It is not a de Polignac number, because 369127 - 23 = 369119 is a prime.

It is an Ulam number.

It is a Duffinian number.

It is a nialpdrome in base 14.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 477 + ... + 982.

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

2369127 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1493.

The product of its digits is 2268, while the sum is 28.

The square root of 369127 is about 607.5582276622. The cubic root of 369127 is about 71.7340367632.

Subtracting 369127 from its reverse (721963), we obtain a square (352836 = 5942).

It can be divided in two parts, 369 and 127, that added together give a triangular number (496 = T31).

The spelling of 369127 in words is "three hundred sixty-nine thousand, one hundred twenty-seven".

Divisors: 1 11 23 253 1459 16049 33557 369127