Base | Representation |
---|---|
bin | 1010000100100100100011… |
… | …1111101011000111101111 |
3 | 1110012122000201202121202012 |
4 | 2201021020333223013233 |
5 | 2422412313441342320 |
6 | 35315055325551435 |
7 | 2222021243560532 |
oct | 241111077530757 |
9 | 43178021677665 |
10 | 11073650340335 |
11 | 358a343a22780 |
12 | 12aa19311557b |
13 | 624318bc5aab |
14 | 2a3d78cc2a19 |
15 | 1430b74c24c5 |
hex | a1248feb1ef |
11073650340335 has 8 divisors (see below), whose sum is σ = 14496414991056. Its totient is φ = 8053563883840.
The previous prime is 11073650340307. The next prime is 11073650340353. The reversal of 11073650340335 is 53304305637011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11073650340335 - 230 = 11072576598511 is a prime.
It is a super-2 number, since 2×110736503403352 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11073650340292 and 11073650340301.
It is a congruent number.
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, 100669548494 + ... + 100669548603.
It is an arithmetic number, because the mean of its divisors is an integer number (1812051873882).
Almost surely, 211073650340335 is an apocalyptic number.
11073650340335 is a deficient number, since it is larger than the sum of its proper divisors (3422764650721).
11073650340335 is a wasteful number, since it uses less digits than its factorization.
11073650340335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201339097113.
The product of its (nonzero) digits is 340200, while the sum is 41.
Adding to 11073650340335 its reverse (53304305637011), we get a palindrome (64377955977346).
The spelling of 11073650340335 in words is "eleven trillion, seventy-three billion, six hundred fifty million, three hundred forty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •