Base | Representation |
---|---|
bin | 1010001000000010000001… |
… | …1110001000100000010101 |
3 | 1110102022110212210022021020 |
4 | 2202000200132020200111 |
5 | 2424401042100020201 |
6 | 35402250414311353 |
7 | 2226224411422335 |
oct | 242004036104025 |
9 | 43368425708236 |
10 | 11133100001301 |
11 | 3602580790993 |
12 | 12b98047b8559 |
13 | 629b01624385 |
14 | 2a6bb86390c5 |
15 | 1448e6766a36 |
hex | a2020788815 |
11133100001301 has 8 divisors (see below), whose sum is σ = 14846245805664. Its totient is φ = 7421010432240.
The previous prime is 11133100001279. The next prime is 11133100001321. The reversal of 11133100001301 is 10310000133111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11133100001301 - 26 = 11133100001237 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11133100001321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 264034230 + ... + 264076391.
It is an arithmetic number, because the mean of its divisors is an integer number (1855780725708).
Almost surely, 211133100001301 is an apocalyptic number.
It is an amenable number.
11133100001301 is a deficient number, since it is larger than the sum of its proper divisors (3713145804363).
11133100001301 is an equidigital number, since it uses as much as digits as its factorization.
11133100001301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528117651.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 11133100001301 its reverse (10310000133111), we get a palindrome (21443100134412).
The spelling of 11133100001301 in words is "eleven trillion, one hundred thirty-three billion, one hundred million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •