Search a number
-
+
15690131 = 29659821
BaseRepresentation
bin111011110110…
…100110010011
31002112010210222
4323312212103
513004041011
61320143255
7250235552
oct73664623
932463728
1015690131
118947256
125307b2b
133334802
142125d99
15159dddb
hexef6993

15690131 has 8 divisors (see below), whose sum is σ = 16275600. Its totient is φ = 15107680.

The previous prime is 15690119. The next prime is 15690137. The reversal of 15690131 is 13109651.

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-15690131 is a prime.

It is a super-2 number, since 2×156901312 = 492360421594322, which 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 15690131.

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

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

Almost surely, 215690131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1509.

The product of its (nonzero) digits is 810, while the sum is 26.

The square root of 15690131 is about 3961.0770000090. The cubic root of 15690131 is about 250.3468837972.

Adding to 15690131 its reverse (13109651), we get a palindrome (28799782).

The spelling of 15690131 in words is "fifteen million, six hundred ninety thousand, one hundred thirty-one".

Divisors: 1 29 659 821 19111 23809 541039 15690131