Search a number
-
+
11013010133100 = 2235236710033777
BaseRepresentation
bin1010000001000010101010…
…0011101001000001101100
31102222211111121111220202220
42200100222203221001230
52420414121043224400
635231150151515340
72214443441403453
oct240205243510154
942884447456686
1011013010133100
113566656125528
12129a48a988b50
1361b6a3933071
142a10653bbb9a
1514171895d7a0
hexa042a8e906c

11013010133100 has 36 divisors (see below), whose sum is σ = 31864309319304. Its totient is φ = 2936802702080.

The previous prime is 11013010133093. The next prime is 11013010133107. The reversal of 11013010133100 is 133101031011.

It is an interprime number because it is at equal distance from previous prime (11013010133093) and next prime (11013010133107).

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

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

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

It is not an unprimeable number, because it can be changed into a prime (11013010133107) 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, 18355016589 + ... + 18355017188.

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

Almost surely, 211013010133100 is an apocalyptic number.

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

It is an amenable number.

11013010133100 is an abundant number, since it is smaller than the sum of its proper divisors (20851299186204).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 15.

Adding to 11013010133100 its reverse (133101031011), we get a palindrome (11146111164111).

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

Divisors: 1 2 3 4 5 6 10 12 15 20 25 30 50 60 75 100 150 300 36710033777 73420067554 110130101331 146840135108 183550168885 220260202662 367100337770 440520405324 550650506655 734200675540 917750844425 1101301013310 1835501688850 2202602026620 2753252533275 3671003377700 5506505066550 11013010133100