Base | Representation |
---|---|
bin | 1010010010100000111101… |
… | …0101010100000111100010 |
3 | 1111001112100102210020102111 |
4 | 2210220033111110013202 |
5 | 2440323413440301310 |
6 | 40021113550105534 |
7 | 2245231445504500 |
oct | 244501725240742 |
9 | 44045312706374 |
10 | 11313201103330 |
11 | 36719a10a7565 |
12 | 13286a81ab2aa |
13 | 640aa41a6bb9 |
14 | 2b17c1a31670 |
15 | 149437c9128a |
hex | a4a0f5541e2 |
11313201103330 has 48 divisors (see below), whose sum is σ = 23787572952960. Its totient is φ = 3862582428768.
The previous prime is 11313201103327. The next prime is 11313201103339. The reversal of 11313201103330 is 3330110231311.
It is not an unprimeable number, because it can be changed into a prime (11313201103339) by changing a digit.
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, 48184492 + ... + 48418711.
It is an arithmetic number, because the mean of its divisors is an integer number (495574436520).
Almost surely, 211313201103330 is an apocalyptic number.
11313201103330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11313201103330 is an abundant number, since it is smaller than the sum of its proper divisors (12474371849630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11313201103330 is a wasteful number, since it uses less digits than its factorization.
11313201103330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96603463 (or 96603456 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11313201103330 its reverse (3330110231311), we get a palindrome (14643311334641).
The spelling of 11313201103330 in words is "eleven trillion, three hundred thirteen billion, two hundred one million, one hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •