Base | Representation |
---|---|
bin | 1010000011010101111011… |
… | …0010000011111101110011 |
3 | 1110010121112120212202202210 |
4 | 2200311132302003331303 |
5 | 2422041101001044410 |
6 | 35301244532143203 |
7 | 2220343161461442 |
oct | 240653662037563 |
9 | 43117476782683 |
10 | 11052541034355 |
11 | 35813a1302757 |
12 | 12a6081767b03 |
13 | 62233375c7b2 |
14 | 2a2d35558d59 |
15 | 14277e183220 |
hex | a0d5ec83f73 |
11052541034355 has 8 divisors (see below), whose sum is σ = 17684065654992. Its totient is φ = 5894688551648.
The previous prime is 11052541034347. The next prime is 11052541034369. The reversal of 11052541034355 is 55343014525011.
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 11052541034355 - 23 = 11052541034347 is a prime.
It is a super-2 number, since 2×110525410343552 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 368418034464 + ... + 368418034493.
It is an arithmetic number, because the mean of its divisors is an integer number (2210508206874).
Almost surely, 211052541034355 is an apocalyptic number.
11052541034355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11052541034355 is a deficient number, since it is larger than the sum of its proper divisors (6631524620637).
11052541034355 is an equidigital number, since it uses as much as digits as its factorization.
11052541034355 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 736836068965.
The product of its (nonzero) digits is 180000, while the sum is 39.
Adding to 11052541034355 its reverse (55343014525011), we get a palindrome (66395555559366).
The spelling of 11052541034355 in words is "eleven trillion, fifty-two billion, five hundred forty-one million, thirty-four thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •