Base | Representation |
---|---|
bin | 1010000011110101110101… |
… | …0001010101001111101001 |
3 | 1110011102122110122101021002 |
4 | 2200331131101111033221 |
5 | 2422211121014034003 |
6 | 35305222440524345 |
7 | 2221065336256031 |
oct | 240753521251751 |
9 | 43142573571232 |
10 | 11061105611753 |
11 | 3584a9683449a |
12 | 12a7871a806b5 |
13 | 623099c48282 |
14 | 2a3508bc88c1 |
15 | 142ad1000a88 |
hex | a0f5d4553e9 |
11061105611753 has 2 divisors, whose sum is σ = 11061105611754. Its totient is φ = 11061105611752.
The previous prime is 11061105611737. The next prime is 11061105611789. The reversal of 11061105611753 is 35711650116011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8788633780969 + 2272471830784 = 2964563^2 + 1507472^2 .
It is a cyclic number.
It is not a de Polignac number, because 11061105611753 - 24 = 11061105611737 is a prime.
It is not a weakly prime, because it can be changed into another prime (11061105611053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5530552805876 + 5530552805877.
It is an arithmetic number, because the mean of its divisors is an integer number (5530552805877).
Almost surely, 211061105611753 is an apocalyptic number.
It is an amenable number.
11061105611753 is a deficient number, since it is larger than the sum of its proper divisors (1).
11061105611753 is an equidigital number, since it uses as much as digits as its factorization.
11061105611753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 38.
Adding to 11061105611753 its reverse (35711650116011), we get a palindrome (46772755727764).
The spelling of 11061105611753 in words is "eleven trillion, sixty-one billion, one hundred five million, six hundred eleven thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •