Base | Representation |
---|---|
bin | 1010001100001101111011… |
… | …0001110010000011100000 |
3 | 1110200012002120110120210120 |
4 | 2203003132301302003200 |
5 | 2432040331122100000 |
6 | 35455302300400240 |
7 | 2234351436034011 |
oct | 243033661620340 |
9 | 43605076416716 |
10 | 11205012300000 |
11 | 3630023369302 |
12 | 130b733b46080 |
13 | 633821cba4cc |
14 | 2aa47b1db008 |
15 | 146704bb46a0 |
hex | a30dec720e0 |
11205012300000 has 144 divisors (see below), whose sum is σ = 36764094541104. Its totient is φ = 2988003200000.
The previous prime is 11205012299977. The next prime is 11205012300043. The reversal of 11205012300000 is 321050211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18375021 + ... + 18975020.
It is an arithmetic number, because the mean of its divisors is an integer number (255306212091).
Almost surely, 211205012300000 is an apocalyptic number.
11205012300000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11205012300000 is an abundant number, since it is smaller than the sum of its proper divisors (25559082241104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11205012300000 is an frugal number, since it uses more digits than its factorization.
11205012300000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37350079 (or 37350051 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 11205012300000 its reverse (321050211), we get a palindrome (11205333350211).
The spelling of 11205012300000 in words is "eleven trillion, two hundred five billion, twelve million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •