Base | Representation |
---|---|
bin | 1010001011111111010111… |
… | …1011011111111110011001 |
3 | 1110122211000022121120221212 |
4 | 2202333311323133332121 |
5 | 2432004331033143212 |
6 | 35453414505512505 |
7 | 2234152561666040 |
oct | 242776573377631 |
9 | 43584008546855 |
10 | 11201105756057 |
11 | 36293a9206a98 |
12 | 130aa237a2735 |
13 | 63334b85ab49 |
14 | 2aa1ca453557 |
15 | 146576c4ee22 |
hex | a2ff5edff99 |
11201105756057 has 8 divisors (see below), whose sum is σ = 12801315840000. Its totient is φ = 9600908701824.
The previous prime is 11201105756053. The next prime is 11201105756143. The reversal of 11201105756057 is 75065750110211.
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 11201105756057 - 22 = 11201105756053 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11201105756053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1340057 + ... + 4919142.
It is an arithmetic number, because the mean of its divisors is an integer number (1600164480000).
Almost surely, 211201105756057 is an apocalyptic number.
It is an amenable number.
11201105756057 is a deficient number, since it is larger than the sum of its proper divisors (1600210083943).
11201105756057 is an equidigital number, since it uses as much as digits as its factorization.
11201105756057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6514855.
The product of its (nonzero) digits is 73500, while the sum is 41.
Adding to 11201105756057 its reverse (75065750110211), we get a palindrome (86266855866268).
The spelling of 11201105756057 in words is "eleven trillion, two hundred one billion, one hundred five million, seven hundred fifty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •