Search a number
-
+
1010500561 = 7232272887
BaseRepresentation
bin111100001110110…
…000001111010001
32121102102202011201
4330032300033101
54032142004221
6244134311201
734020053530
oct7416601721
92542382151
101010500561
11479446034
122424b8501
13131475835
14982c2317
155daa7891
hex3c3b03d1

1010500561 has 12 divisors (see below), whose sum is σ = 1207256512. Its totient is φ = 828481896.

The previous prime is 1010500537. The next prime is 1010500573. The reversal of 1010500561 is 1650050101.

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

It is not a de Polignac number, because 1010500561 - 27 = 1010500433 is a prime.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 132741 + ... + 140146.

Almost surely, 21010500561 is an apocalyptic number.

It is an amenable number.

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

1010500561 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 272940 (or 272917 counting only the distinct ones).

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

The square root of 1010500561 is about 31788.3714744873. The cubic root of 1010500561 is about 1003.4880066643.

Adding to 1010500561 its reverse (1650050101), we get a palindrome (2660550662).

The spelling of 1010500561 in words is "one billion, ten million, five hundred thousand, five hundred sixty-one".

Divisors: 1 7 23 161 529 3703 272887 1910209 6276401 43934807 144357223 1010500561