Base | Representation |
---|---|
bin | 10000000001101010110… |
… | …010011010111101011100 |
3 | 10220021122201022201121122 |
4 | 100001222302122331130 |
5 | 121020432111332200 |
6 | 2201533130150112 |
7 | 142365215000540 |
oct | 20015262327534 |
9 | 3807581281548 |
10 | 1101303230300 |
11 | 395072a65229 |
12 | 159534282338 |
13 | 7cb10aa4670 |
14 | 3b4365c9a20 |
15 | 1d9aa0cd385 |
hex | 1006ac9af5c |
1101303230300 has 72 divisors (see below), whose sum is σ = 2941326805536. Its totient is φ = 348544316160.
The previous prime is 1101303230299. The next prime is 1101303230317. The reversal of 1101303230300 is 30323031011.
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, 60502067 + ... + 60520266.
It is an arithmetic number, because the mean of its divisors is an integer number (40851761188).
Almost surely, 21101303230300 is an apocalyptic number.
1101303230300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101303230300 is an abundant number, since it is smaller than the sum of its proper divisors (1840023575236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101303230300 is a wasteful number, since it uses less digits than its factorization.
1101303230300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121022367 (or 121022360 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1101303230300 its reverse (30323031011), we get a palindrome (1131626261311).
The spelling of 1101303230300 in words is "one trillion, one hundred one billion, three hundred three million, two hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •