Search a number
-
+
1100033010010 = 251110000300091
BaseRepresentation
bin10000000000011111000…
…100111010100101011010
310220011101012011211221201
4100000133010322211122
5121010331422310020
62201203113024414
7142321562210434
oct20003704724532
93804335154851
101100033010010
11394580a579a0
1215923a9b510a
137c96a89531c
143b355a1b654
151d933821a0a
hex1001f13a95a

1100033010010 has 16 divisors (see below), whose sum is σ = 2160064819872. Its totient is φ = 400012003600.

The previous prime is 1100033009981. The next prime is 1100033010031. The reversal of 1100033010010 is 100103300011.

It is a super-2 number, since 2×11000330100102 (a number of 25 digits) contains 22 as substring.

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

It is an unprimeable number.

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

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

Almost surely, 21100033010010 is an apocalyptic number.

1100033010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10000300109.

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

Adding to 1100033010010 its reverse (100103300011), we get a palindrome (1200136310021).

The spelling of 1100033010010 in words is "one trillion, one hundred billion, thirty-three million, ten thousand, ten".

Divisors: 1 2 5 10 11 22 55 110 10000300091 20000600182 50001500455 100003000910 110003301001 220006602002 550016505005 1100033010010