Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
10201101 = 3101131257
BaseRepresentation
bin100110111010…
…100000001101
3201012021021120
4212322200031
510102413401
61002351153
7152464551
oct46724015
921167246
1010201101
115838269
1234bb4b9
132162271
1414d7861
15d67836
hex9ba80d

10201101 has 16 divisors (see below), whose sum is σ = 13894848. Its totient is φ = 6656000.

The previous prime is 10201073. The next prime is 10201109. The reversal of 10201101 is 10110201.

10201101 = T398 + T399 + ... + T498.

10201101 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a 6-Lehmer number, since φ(10201101) divides (10201101-1)6.

It is a cyclic number.

It is not a de Polignac number, because 10201101 - 210 = 10200077 is a prime.

It is a super-2 number, since 2×102011012 = 208124923224402, which contains 22 as substring.

It is a Curzon number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39565 + ... + 39821.

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

Almost surely, 210201101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 492.

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

The square root of 10201101 is about 3193.9162481192. The cubic root of 10201101 is about 216.8780913223.

Adding to 10201101 its reverse (10110201), we get a palindrome (20311302).

Multiplying 10201101 by its reverse (10110201), we get a palindrome (103135181531301).

It can be divided in two parts, 10201 and 101, that multiplied together give a palindrome (1030301).

The spelling of 10201101 in words is "ten million, two hundred one thousand, one hundred one".

Divisors: 1 3 101 131 257 303 393 771 13231 25957 33667 39693 77871 101001 3400367 10201101