Search a number
-
+
10201101001 = 713433138329
BaseRepresentation
bin10011000000000100…
…00111001011001001
3222022221011121211121
421200002013023021
5131342440213001
64404124555241
7510535633150
oct114002071311
928287147747
1010201101001
11436528a193
121b883b2b21
13c6756b950
146cab50597
153ea8836a1
hex2600872c9

10201101001 has 32 divisors (see below), whose sum is σ = 12889775360. Its totient is φ = 7857368064.

The previous prime is 10201100977. The next prime is 10201101011. The reversal of 10201101001 is 10010110201.

It is not a de Polignac number, because 10201101001 - 233 = 1611166409 is a prime.

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

It is the 101001-st Hogben number.

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

It is a nontrivial repunit in base 101000.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1220605 + ... + 1228933.

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

Almost surely, 210201101001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8705.

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

Adding to 10201101001 its reverse (10010110201), we get a palindrome (20211211202).

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

Divisors: 1 7 13 43 91 301 313 559 2191 3913 4069 8329 13459 28483 58303 94213 108277 174967 358147 757939 1224769 2507029 2606977 4655911 18248839 32591377 33890701 112100011 237234907 784700077 1457300143 10201101001