Search a number
-
+
10011111101002 = 211755116026281
BaseRepresentation
bin1001000110101110010010…
…1110001001001001001010
31022110001102112201122222201
42101223210232021021022
52303010223420213002
633143012502310414
72052164444215624
oct221534456111112
938401375648881
1010011111101002
11320a763255720
121158278a2840a
135780750b23bb
1426877ca7dc14
1512562a62b087
hex91ae4b8924a

10011111101002 has 16 divisors (see below), whose sum is σ = 16382037829824. Its totient is φ = 4550444028000.

The previous prime is 10011111100993. The next prime is 10011111101029. The reversal of 10011111101002 is 20010111111001.

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 1351899 + ... + 4674382.

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

Almost surely, 210011111101002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6101805.

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

Adding to 10011111101002 its reverse (20010111111001), we get a palindrome (30021222212003).

Subtracting 10011111101002 from its reverse (20010111111001), we obtain a palindrome (9999000009999).

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

Divisors: 1 2 11 22 75511 151022 830621 1661242 6026281 12052562 66289091 132578182 455050504591 910101009182 5005555550501 10011111101002