Search a number
-
+
10145967 = 3132311311
BaseRepresentation
bin100110101101…
…000010101111
3201002110122120
4212231002233
510044132332
61001244023
7152145036
oct46550257
921073576
1010145967
1157aa8a7
123493613
132143140
1414c171d
15d5632c
hex9ad0af

10145967 has 16 divisors (see below), whose sum is σ = 15203328. Its totient is φ = 5971680.

The previous prime is 10145939. The next prime is 10145977. The reversal of 10145967 is 76954101.

10145967 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10145967 - 211 = 10143919 is a prime.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4759 + ... + 6552.

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

Almost surely, 210145967 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11350.

The product of its (nonzero) digits is 7560, while the sum is 33.

The square root of 10145967 is about 3185.2734576485. The cubic root of 10145967 is about 216.4866641740.

The spelling of 10145967 in words is "ten million, one hundred forty-five thousand, nine hundred sixty-seven".

Divisors: 1 3 13 23 39 69 299 897 11311 33933 147043 260153 441129 780459 3381989 10145967