Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …001111000111000111100 |
3 | 10220021101112200212100112 |
4 | 100001210221320320330 |
5 | 121020224241032200 |
6 | 2201515012445152 |
7 | 142362525236540 |
oct | 20014451707074 |
9 | 3807345625315 |
10 | 1101200330300 |
11 | 39501a972a04 |
12 | 1595059197b8 |
13 | 7cac5686ba5 |
14 | 3b426a81a20 |
15 | 1d9a1054535 |
hex | 10064a78e3c |
1101200330300 has 72 divisors (see below), whose sum is σ = 2819072901120. Its totient is φ = 365375217600.
The previous prime is 1101200330189. The next prime is 1101200330303. The reversal of 1101200330300 is 30330021011.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101200330303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25351580 + ... + 25394979.
Almost surely, 21101200330300 is an apocalyptic number.
1101200330300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101200330300 is an abundant number, since it is smaller than the sum of its proper divisors (1717872570820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101200330300 is a wasteful number, since it uses less digits than its factorization.
1101200330300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50746611 (or 50746604 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1101200330300 its reverse (30330021011), we get a palindrome (1131530351311).
The spelling of 1101200330300 in words is "one trillion, one hundred one billion, two hundred million, three hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •