Search a number
-
+
10132507 = 711131591
BaseRepresentation
bin100110101001…
…110000011011
3201001210012001
4212221300123
510043220012
61001101431
7152060560
oct46516033
921053161
1010132507
1157a0780
123487877
132139c88
1414ba867
15d52357
hex9a9c1b

10132507 has 8 divisors (see below), whose sum is σ = 12632832. Its totient is φ = 7895400.

The previous prime is 10132501. The next prime is 10132537. The reversal of 10132507 is 70523101.

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

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

It is a cyclic number.

It is not a de Polignac number, because 10132507 - 219 = 9608219 is a prime.

It is a Duffinian number.

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

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

Almost surely, 210132507 is an apocalyptic number.

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

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

10132507 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 131609.

The product of its (nonzero) digits is 210, while the sum is 19.

The square root of 10132507 is about 3183.1599080159. The cubic root of 10132507 is about 216.3908888439.

Adding to 10132507 its reverse (70523101), we get a palindrome (80655608).

The spelling of 10132507 in words is "ten million, one hundred thirty-two thousand, five hundred seven".

Divisors: 1 7 11 77 131591 921137 1447501 10132507