Base | Representation |
---|---|
bin | 10101001001011001… |
… | …01001101011100101 |
3 | 1002022012212101121011 |
4 | 22210230221223211 |
5 | 141222343244302 |
6 | 5114320222221 |
7 | 551224532611 |
oct | 124454515345 |
9 | 32265771534 |
10 | 11353103077 |
11 | 48a6592418 |
12 | 224a16a971 |
13 | 10bc129094 |
14 | 799b48341 |
15 | 466a8c5d7 |
hex | 2a4b29ae5 |
11353103077 has 8 divisors (see below), whose sum is σ = 11754167040. Its totient is φ = 10952677680.
The previous prime is 11353103059. The next prime is 11353103093. The reversal of 11353103077 is 77030135311.
11353103077 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11353103077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11353106077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 123313 + ... + 194710.
It is an arithmetic number, because the mean of its divisors is an integer number (1469270880).
Almost surely, 211353103077 is an apocalyptic number.
It is an amenable number.
11353103077 is a deficient number, since it is larger than the sum of its proper divisors (401063963).
11353103077 is a wasteful number, since it uses less digits than its factorization.
11353103077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319283.
The product of its (nonzero) digits is 6615, while the sum is 31.
Adding to 11353103077 its reverse (77030135311), we get a palindrome (88383238388).
The spelling of 11353103077 in words is "eleven billion, three hundred fifty-three million, one hundred three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •