Search a number
-
+
101110021102013 = 7111313117157169
BaseRepresentation
bin10110111111010110000010…
…111001000001100110111101
3111021000000122012212000122212
4112333112002321001212331
5101223041310400231023
6555013145155150205
730203646402630530
oct2677260271014675
9437000565760585
10101110021102013
112a242578a85460
12b40b9715a5365
1344558320b9581
141ad7a73172a17
15ba5184deae78
hex5bf582e419bd

101110021102013 has 8 divisors (see below), whose sum is σ = 126059247088320. Its totient is φ = 78787029430080.

The previous prime is 101110021102009. The next prime is 101110021102031. The reversal of 101110021102013 is 310201120011101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 101110021102013 - 22 = 101110021102009 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 656558578508 + ... + 656558578661.

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

Almost surely, 2101110021102013 is an apocalyptic number.

It is an amenable number.

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

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

101110021102013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1313117157187.

The product of its (nonzero) digits is 12, while the sum is 14.

Adding to 101110021102013 its reverse (310201120011101), we get a palindrome (411311141113114).

The spelling of 101110021102013 in words is "one hundred one trillion, one hundred ten billion, twenty-one million, one hundred two thousand, thirteen".

Divisors: 1 7 11 77 1313117157169 9191820100183 14444288728859 101110021102013