Base | Representation |
---|---|
bin | 101101101110100101011000… |
… | …110001101001010001001100 |
3 | 222101002020122222011122122201 |
4 | 231232211120301221101030 |
5 | 202330020101224404200 |
6 | 1551422104552251244 |
7 | 60234646606124365 |
oct | 5556453061512114 |
9 | 871066588148581 |
10 | 201113333044300 |
11 | 5909875a542916 |
12 | 1a6811403a0b24 |
13 | 882aba1436481 |
14 | 3793d19b8cb6c |
15 | 183b64532bc6a |
hex | b6e958c6944c |
201113333044300 has 36 divisors (see below), whose sum is σ = 437016229882960. Its totient is φ = 80334679360320.
The previous prime is 201113333044277. The next prime is 201113333044313. The reversal of 201113333044300 is 3440333311102.
It is a super-3 number, since 3×2011133330443003 (a number of 44 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1383100155 + ... + 1383245554.
Almost surely, 2201113333044300 is an apocalyptic number.
201113333044300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201113333044300 is an abundant number, since it is smaller than the sum of its proper divisors (235902896838660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201113333044300 is a wasteful number, since it uses less digits than its factorization.
201113333044300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2766346450 (or 2766346443 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 201113333044300 its reverse (3440333311102), we get a palindrome (204553666355402).
The spelling of 201113333044300 in words is "two hundred one trillion, one hundred thirteen billion, three hundred thirty-three million, forty-four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •