Search a number
-
+
10011100011002 = 216956432952007
BaseRepresentation
bin1001000110101110010000…
…0011110101100111111010
31022110001101202212020100222
42101223210003311213322
52303010213100323002
633143011424500042
72052164251026356
oct221534403654772
938401352766328
1010011100011002
11320a757a70632
12115827517a622
135780729cb67c
1426877b3d4466
1512562968a1a2
hex91ae40f59fa

10011100011002 has 8 divisors (see below), whose sum is σ = 15016663959456. Its totient is φ = 5005545357852.

The previous prime is 10011100010981. The next prime is 10011100011007. The reversal of 10011100011002 is 20011000111001.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1915283 + ... + 4867289.

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

Almost surely, 210011100011002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4647652.

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

Adding to 10011100011002 its reverse (20011000111001), we get a palindrome (30022100122003).

Subtracting 10011100011002 from its reverse (20011000111001), we obtain a palindrome (9999900099999).

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

Divisors: 1 2 1695643 2952007 3391286 5904014 5005550005501 10011100011002