Base | Representation |
---|---|
bin | 1010001100101011101011… |
… | …1001100101111001111000 |
3 | 1110200221201021022010210220 |
4 | 2203022322321211321320 |
5 | 2432203211034132300 |
6 | 35503103051140040 |
7 | 2235053412654114 |
oct | 243127271457170 |
9 | 43627637263726 |
10 | 11213000302200 |
11 | 3633452391614 |
12 | 13111a3144620 |
13 | 6344c5bbc628 |
14 | 2aa9d8060744 |
15 | 146a210deda0 |
hex | a32bae65e78 |
11213000302200 has 96 divisors (see below), whose sum is σ = 34780501874160. Its totient is φ = 2988395699200.
The previous prime is 11213000302181. The next prime is 11213000302201. The reversal of 11213000302200 is 220300031211.
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 11213000302200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213000302201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4396899 + ... + 6462098.
Almost surely, 211213000302200 is an apocalyptic number.
11213000302200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11213000302200 is an abundant number, since it is smaller than the sum of its proper divisors (23567501571960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11213000302200 is a wasteful number, since it uses less digits than its factorization.
11213000302200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10860737 (or 10860728 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11213000302200 its reverse (220300031211), we get a palindrome (11433300333411).
The spelling of 11213000302200 in words is "eleven trillion, two hundred thirteen billion, three hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •