Base | Representation |
---|---|
bin | 1010010001110000010001… |
… | …0111110101100010010001 |
3 | 1111000021121122112220200122 |
4 | 2210130010113311202101 |
5 | 2440120132333010413 |
6 | 40011113100400025 |
7 | 2244256545562601 |
oct | 244340427654221 |
9 | 44007548486618 |
10 | 11300132313233 |
11 | 36673a5108095 |
12 | 132605b546015 |
13 | 63c7a079b2ca |
14 | 2b0d020bac01 |
15 | 148e207a2108 |
hex | a47045f5891 |
11300132313233 has 8 divisors (see below), whose sum is σ = 11313903713280. Its totient is φ = 11286363238560.
The previous prime is 11300132313193. The next prime is 11300132313247. The reversal of 11300132313233 is 33231323100311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11300132313233 - 228 = 11299863877777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11300132315233) 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 7 ways as a sum of consecutive naturals, for example, 9244613 + ... + 10395341.
It is an arithmetic number, because the mean of its divisors is an integer number (1414237964160).
Almost surely, 211300132313233 is an apocalyptic number.
It is an amenable number.
11300132313233 is a deficient number, since it is larger than the sum of its proper divisors (13771400047).
11300132313233 is a wasteful number, since it uses less digits than its factorization.
11300132313233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1162687.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 11300132313233 its reverse (33231323100311), we get a palindrome (44531455413544).
The spelling of 11300132313233 in words is "eleven trillion, three hundred billion, one hundred thirty-two million, three hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •