Search a number
-
+
9131397 = 3111741397
BaseRepresentation
bin100010110101…
…010110000101
3122011220220220
4202311112011
54314201042
6523414553
7140421102
oct42652605
918156826
109131397
115177610
123084459
131b793c2
1412d9aa9
15c058ec
hex8b5585

9131397 has 32 divisors (see below), whose sum is σ = 14442624. Its totient is φ = 5068800.

The previous prime is 9131389. The next prime is 9131399. The reversal of 9131397 is 7931319.

It is not a de Polignac number, because 9131397 - 23 = 9131389 is a prime.

It is a super-2 number, since 2×91313972 = 166764822343218, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (33).

It is an Ulam number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (9131399) 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 31 ways as a sum of consecutive naturals, for example, 22803 + ... + 23199.

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

Almost surely, 29131397 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 469.

The product of its digits is 5103, while the sum is 33.

The square root of 9131397 is about 3021.8201468651. The cubic root of 9131397 is about 209.0157798881.

The spelling of 9131397 in words is "nine million, one hundred thirty-one thousand, three hundred ninety-seven".

Divisors: 1 3 11 17 33 41 51 123 187 397 451 561 697 1191 1353 2091 4367 6749 7667 13101 16277 20247 23001 48831 74239 179047 222717 276709 537141 830127 3043799 9131397