Search a number
-
+
9152013 = 313613847
BaseRepresentation
bin100010111010…
…011000001101
3122012222012110
4202322120031
54320331023
6524054233
7140535153
oct42723015
918188173
109152013
115191052
123094379
131b858c0
1413033d3
15c0ba93
hex8ba60d

9152013 has 16 divisors (see below), whose sum is σ = 13360256. Its totient is φ = 5538240.

The previous prime is 9152009. The next prime is 9152051. The reversal of 9152013 is 3102519.

9152013 = T517 + T518 + ... + T577.

It is not a de Polignac number, because 9152013 - 22 = 9152009 is a prime.

9152013 is a modest number, since divided by 2013 gives 915 as remainder.

It is a congruent number.

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

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

Almost surely, 29152013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3924.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 9152013 is about 3025.2294127884. The cubic root of 9152013 is about 209.1729603104.

The spelling of 9152013 in words is "nine million, one hundred fifty-two thousand, thirteen".

Divisors: 1 3 13 39 61 183 793 2379 3847 11541 50011 150033 234667 704001 3050671 9152013