Search a number
-
+
10111201010001 = 3271337477199991
BaseRepresentation
bin1001001100100011001010…
…0010110110000101010001
31022210121202222112212012100
42103020302202312011101
52311130214424310001
633301004400351013
72062336662340530
oct223106242660521
938717688485170
1010111201010001
11324915540a783
121173750915469
13584636411520
1426d555a26317
151280376c5586
hex932328b6151

10111201010001 has 192 divisors, whose sum is σ = 19119827091456. Its totient is φ = 5007243225600.

The previous prime is 10111201009969. The next prime is 10111201010011. The reversal of 10111201010001 is 10001010211101.

It is not a de Polignac number, because 10111201010001 - 25 = 10111201009969 is a prime.

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

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 101071116 + ... + 101171106.

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

Almost surely, 210111201010001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 10111201010001 its reverse (10001010211101), we get a palindrome (20112211221102).

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