Search a number
-
+
13210152011 = 72269594939
BaseRepresentation
bin11000100110110001…
…01110110001001011
31021002122020020211022
430103120232301023
5204023244331021
610022455223055
7645234303500
oct142330566113
937078206738
1013210152011
115669871801
122688077a8b
131326aa1ac4
148d46314a7
15524b141ab
hex31362ec4b

13210152011 has 6 divisors (see below), whose sum is σ = 15366911580. Its totient is φ = 11322987396.

The previous prime is 13210151993. The next prime is 13210152017. The reversal of 13210152011 is 11025101231.

13210152011 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 13210152011 - 222 = 13205957707 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (13210152017) 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 5 ways as a sum of consecutive naturals, for example, 134797421 + ... + 134797518.

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

Almost surely, 213210152011 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

Adding to 13210152011 its reverse (11025101231), we get a palindrome (24235253242).

The spelling of 13210152011 in words is "thirteen billion, two hundred ten million, one hundred fifty-two thousand, eleven".

Divisors: 1 7 49 269594939 1887164573 13210152011