Search a number
-
+
11000001102003 = 3210131206537359
BaseRepresentation
bin1010000000010010001100…
…1010001000000010110011
31102221120220222201122222100
42200010203022020002303
52420211000240231003
635221155235111443
72213503165433214
oct240044312100263
942846828648870
1011000001102003
11356108a941961
121297a5a142583
1361a3ac71b824
142a058d78140b
15141206825ba3
hexa01232880b3

11000001102003 has 12 divisors (see below), whose sum is σ = 15904575479520. Its totient is φ = 7326094837776.

The previous prime is 11000001101951. The next prime is 11000001102007. The reversal of 11000001102003 is 30020110000011.

It is not a de Polignac number, because 11000001102003 - 213 = 11000001093811 is a prime.

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

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 (11000001102007) by changing a digit.

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

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

Almost surely, 211000001102003 is an apocalyptic number.

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

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

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

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

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

Adding to 11000001102003 its reverse (30020110000011), we get a palindrome (41020111102014).

The spelling of 11000001102003 in words is "eleven trillion, one million, one hundred two thousand, three".

Divisors: 1 3 9 1013 3039 9117 1206537359 3619612077 10858836231 1222222344667 3666667034001 11000001102003