Base | Representation |
---|---|
bin | 1010010010001100011110… |
… | …1100001001000100100111 |
3 | 1111001000011100022121112012 |
4 | 2210203013230021010213 |
5 | 2440231134231114201 |
6 | 40014404303344435 |
7 | 2244645310325321 |
oct | 244430754110447 |
9 | 44030140277465 |
10 | 11307704160551 |
11 | 366a630231047 |
12 | 13276132b211b |
13 | 6404093c3936 |
14 | 2b141d972611 |
15 | 1492153c75bb |
hex | a48c7b09127 |
11307704160551 has 4 divisors (see below), whose sum is σ = 11466967599504. Its totient is φ = 11148440721600.
The previous prime is 11307704160499. The next prime is 11307704160553. The reversal of 11307704160551 is 15506140770311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11307704160551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11307704160499 and 11307704160508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11307704160553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79631719370 + ... + 79631719511.
It is an arithmetic number, because the mean of its divisors is an integer number (2866741899876).
Almost surely, 211307704160551 is an apocalyptic number.
11307704160551 is a deficient number, since it is larger than the sum of its proper divisors (159263438953).
11307704160551 is an equidigital number, since it uses as much as digits as its factorization.
11307704160551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159263438952.
The product of its (nonzero) digits is 88200, while the sum is 41.
The spelling of 11307704160551 in words is "eleven trillion, three hundred seven billion, seven hundred four million, one hundred sixty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •