Search a number
-
+
10000111400001 = 322115265988099
BaseRepresentation
bin1001000110000101010100…
…0101100111010001000001
31022102000000221211221220100
42101201111011213101001
52302320212004300001
633133553204433013
72051325040256532
oct221412505472101
938360027757810
1010000111400001
113206029201538
1211561090a8769
13577011260b98
14268017c4a689
151251d4aea586
hex91855167441

10000111400001 has 12 divisors (see below), whose sum is σ = 14513063203600. Its totient is φ = 6635145003480.

The previous prime is 10000111399991. The next prime is 10000111400051. The reversal of 10000111400001 is 10000411100001.

It is not a de Polignac number, because 10000111400001 - 218 = 10000111137857 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 not an unprimeable number, because it can be changed into a prime (10000111400051) by changing a digit.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2632992151 + ... + 2632995948.

Almost surely, 210000111400001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 10000111400001 its reverse (10000411100001), we get a palindrome (20000522500002).

The spelling of 10000111400001 in words is "ten trillion, one hundred eleven million, four hundred thousand, one".

Divisors: 1 3 9 211 633 1899 5265988099 15797964297 47393892891 1111123488889 3333370466667 10000111400001