Base | Representation |
---|---|
bin | 1010000001010001101101… |
… | …1100010011001001101111 |
3 | 1110000012221021002112000111 |
4 | 2200110123130103021233 |
5 | 2421000410142030201 |
6 | 35233055200440451 |
7 | 2214645543532432 |
oct | 240243334231157 |
9 | 43005837075014 |
10 | 11017051517551 |
11 | 356833a405482 |
12 | 129b218319127 |
13 | 61bb98cb4501 |
14 | 2a132a025819 |
15 | 1418a365ab51 |
hex | a051b71326f |
11017051517551 has 4 divisors (see below), whose sum is σ = 11314809666712. Its totient is φ = 10719293368392.
The previous prime is 11017051517467. The next prime is 11017051517603. The reversal of 11017051517551 is 15571515071011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11017051517551 - 29 = 11017051517039 is a prime.
It is a super-2 number, since 2×110170515175512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11017051514551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148879074525 + ... + 148879074598.
It is an arithmetic number, because the mean of its divisors is an integer number (2828702416678).
Almost surely, 211017051517551 is an apocalyptic number.
11017051517551 is a deficient number, since it is larger than the sum of its proper divisors (297758149161).
11017051517551 is an equidigital number, since it uses as much as digits as its factorization.
11017051517551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297758149160.
The product of its (nonzero) digits is 30625, while the sum is 40.
Adding to 11017051517551 its reverse (15571515071011), we get a palindrome (26588566588562).
The spelling of 11017051517551 in words is "eleven trillion, seventeen billion, fifty-one million, five hundred seventeen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •