Base | Representation |
---|---|
bin | 1010010010100000111111… |
… | …0111101110010000100100 |
3 | 1111001112101001202111111110 |
4 | 2210220033313232100210 |
5 | 2440323423242421200 |
6 | 40021114511305020 |
7 | 2245231615253001 |
oct | 244501767562044 |
9 | 44045331674443 |
10 | 11313210123300 |
11 | 36719a61a8388 |
12 | 13286ab21b170 |
13 | 640aa6014667 |
14 | 2b17c2cdc8a8 |
15 | 149438973b50 |
hex | a4a0fdee424 |
11313210123300 has 144 divisors (see below), whose sum is σ = 32824769691392. Its totient is φ = 3008396160000.
The previous prime is 11313210123263. The next prime is 11313210123311. The reversal of 11313210123300 is 332101231311.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 221797800 + ... + 221848800.
Almost surely, 211313210123300 is an apocalyptic number.
11313210123300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11313210123300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16412384845696).
11313210123300 is an abundant number, since it is smaller than the sum of its proper divisors (21511559568092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11313210123300 is a wasteful number, since it uses less digits than its factorization.
11313210123300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53078 (or 53071 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11313210123300 its reverse (332101231311), we get a palindrome (11645311354611).
The spelling of 11313210123300 in words is "eleven trillion, three hundred thirteen billion, two hundred ten million, one hundred twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •