Search a number
-
+
13210210153 = 759173318457
BaseRepresentation
bin11000100110110001…
…11100111101101001
31021002122100012120201
430103120330331221
5204023303211103
610022500352201
7645234635140
oct142330747551
937078305521
1013210210153
115669901458
1226880a5661
131326ac23ca
148d4648757
15524b2651d
hex31363cf69

13210210153 has 16 divisors (see below), whose sum is σ = 15362962560. Its totient is φ = 11124095616.

The previous prime is 13210210151. The next prime is 13210210157. The reversal of 13210210153 is 35101201231.

It is a cyclic number.

It is not a de Polignac number, because 13210210153 - 21 = 13210210151 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 13210210153.

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

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

Almost surely, 213210210153 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 20256.

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

Adding to 13210210153 its reverse (35101201231), we get a palindrome (48311411384).

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

Divisors: 1 7 59 413 1733 12131 18457 102247 129199 715729 1088963 7622741 31985981 223901867 1887172879 13210210153