Search a number
-
+
10201100110101 = 322671424356259
BaseRepresentation
bin1001010001110010000011…
…1100101100100100010101
31100010012211012120022200100
42110130200330230210111
52314113323112010401
633410153134204313
72102001525153345
oct224344074544425
940105735508610
1010201100110101
11328329808521a
12118905b953699
1358cc62366504
14273a4337ad25
1512a549c70b86
hex94720f2c915

10201100110101 has 12 divisors (see below), whose sum is σ = 14740439047360. Its totient is φ = 6798187253160.

The previous prime is 10201100110087. The next prime is 10201100110183. The reversal of 10201100110101 is 10101100110201.

It is not a de Polignac number, because 10201100110101 - 29 = 10201100109589 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a congruent number.

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

Almost surely, 210201100110101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 10201100110101 its reverse (10101100110201), we get a palindrome (20302200220302).

The spelling of 10201100110101 in words is "ten trillion, two hundred one billion, one hundred million, one hundred ten thousand, one hundred one".

Divisors: 1 3 9 2671 8013 24039 424356259 1273068777 3819206331 1133455567789 3400366703367 10201100110101