Search a number
-
+
10506411289 = 11197224611
BaseRepresentation
bin10011100100011101…
…10001110100011001
31000010012122222211001
421302032301310121
5133004120130124
64454312505001
7521234010463
oct116216616431
930105588731
1010506411289
114501660340
1220526ab161
13cb58a881a
14719507133
15417590b44
hex2723b1d19

10506411289 has 12 divisors (see below), whose sum is σ = 11520483408. Its totient is φ = 9502413200.

The previous prime is 10506411239. The next prime is 10506411313. The reversal of 10506411289 is 98211460501.

10506411289 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 10506411289 - 29 = 10506410777 is a prime.

It is a super-2 number, since 2×105064112892 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 210506411289 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 17280, while the sum is 37.

The spelling of 10506411289 in words is "ten billion, five hundred six million, four hundred eleven thousand, two hundred eighty-nine".

Divisors: 1 11 197 2167 24611 38809 270721 426899 4848367 53332037 955128299 10506411289