Search a number
-
+
13101020101 = 132103974611
BaseRepresentation
bin11000011001110000…
…11011001111000101
31020211000212202222201
430030320123033011
5203312330120401
610004000154501
7642440555611
oct141470331705
936730782881
1013101020101
115613203344
122657608a31
13130a2b1900
148c3d44341
1551a258b01
hex30ce1b3c5

13101020101 has 12 divisors (see below), whose sum is σ = 14200155840. Its totient is φ = 12081448080.

The previous prime is 13101020083. The next prime is 13101020147. The reversal of 13101020101 is 10102010131.

13101020101 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 13101020101 - 217 = 13100889029 is a prime.

It is a congruent number.

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

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

Almost surely, 213101020101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 6, while the sum is 10.

Adding to 13101020101 its reverse (10102010131), we get a palindrome (23203030232).

The spelling of 13101020101 in words is "thirteen billion, one hundred one million, twenty thousand, one hundred one".

Divisors: 1 13 169 1039 13507 74611 175591 969943 12609259 77520829 1007770777 13101020101