Base | Representation |
---|---|
bin | 1010000010111110000011… |
… | …0111101010000010111110 |
3 | 1110010000000001011121110111 |
4 | 2200233200313222002332 |
5 | 2421434440200321132 |
6 | 35254305042500234 |
7 | 2220025326305161 |
oct | 240574067520276 |
9 | 43100001147414 |
10 | 11046133604542 |
11 | 35797034a1913 |
12 | 12a499396467a |
13 | 6218521506ca |
14 | 2a28c85adad8 |
15 | 1425068ba647 |
hex | a0be0dea0be |
11046133604542 has 4 divisors (see below), whose sum is σ = 16569200406816. Its totient is φ = 5523066802270.
The previous prime is 11046133604491. The next prime is 11046133604581. The reversal of 11046133604542 is 24540633164011.
11046133604542 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×110461336045423 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11046133604495 and 11046133604504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2761533401134 + ... + 2761533401137.
It is an arithmetic number, because the mean of its divisors is an integer number (4142300101704).
Almost surely, 211046133604542 is an apocalyptic number.
11046133604542 is a deficient number, since it is larger than the sum of its proper divisors (5523066802274).
11046133604542 is an equidigital number, since it uses as much as digits as its factorization.
11046133604542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5523066802273.
The product of its (nonzero) digits is 207360, while the sum is 40.
Adding to 11046133604542 its reverse (24540633164011), we get a palindrome (35586766768553).
The spelling of 11046133604542 in words is "eleven trillion, forty-six billion, one hundred thirty-three million, six hundred four thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •