Search a number
-
+
1041131507 = 131073372221
BaseRepresentation
bin111110000011100…
…110011111110011
32200120001221221012
4332003212133303
54113012202012
6251151021135
734541320553
oct7603463763
92616057835
101041131507
11494767569
1225080a7ab
1313790ba60
149c3b7163
1561608622
hex3e0e67f3

1041131507 has 16 divisors (see below), whose sum is σ = 1135566432. Its totient is φ = 948810240.

The previous prime is 1041131503. The next prime is 1041131537. The reversal of 1041131507 is 7051311401.

It is a happy number.

It is a cyclic number.

It is not a de Polignac number, because 1041131507 - 22 = 1041131503 is a prime.

It is a zygodrome in base 2.

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

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

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

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

Almost surely, 21041131507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2678.

The product of its (nonzero) digits is 420, while the sum is 23.

The square root of 1041131507 is about 32266.5694953771. The cubic root of 1041131507 is about 1013.5267055681.

Adding to 1041131507 its reverse (7051311401), we get a palindrome (8092442908).

The spelling of 1041131507 in words is "one billion, forty-one million, one hundred thirty-one thousand, five hundred seven".

Divisors: 1 13 107 337 1391 2221 4381 28873 36059 237647 468767 748477 3089411 9730201 80087039 1041131507