Base | Representation |
---|---|
bin | 1010000111111011011100… |
… | …1010000001100011111100 |
3 | 1110102010220202002112221020 |
4 | 2201332313022001203330 |
5 | 2424333432234403200 |
6 | 35401355220104140 |
7 | 2226132545252526 |
oct | 241766712014374 |
9 | 43363822075836 |
10 | 11131333122300 |
11 | 3601854399606 |
12 | 12b93b0b35050 |
13 | 6298ac55ca41 |
14 | 2a6a8bb04a16 |
15 | 1448415a1ea0 |
hex | a1fb72818fc |
11131333122300 has 144 divisors (see below), whose sum is σ = 32253442314240. Its totient is φ = 2964046544640.
The previous prime is 11131333122293. The next prime is 11131333122313. The reversal of 11131333122300 is 322133313111.
It is a super-2 number, since 2×111313331223002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 707777037 + ... + 707792763.
Almost surely, 211131333122300 is an apocalyptic number.
11131333122300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11131333122300 is an abundant number, since it is smaller than the sum of its proper divisors (21122109191940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131333122300 is a wasteful number, since it uses less digits than its factorization.
11131333122300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19020 (or 19013 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 11131333122300 its reverse (322133313111), we get a palindrome (11453466435411).
The spelling of 11131333122300 in words is "eleven trillion, one hundred thirty-one billion, three hundred thirty-three million, one hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •