Base | Representation |
---|---|
bin | 10011000101000111010… |
… | …011000000100010010111 |
3 | 11122100100002002200022222 |
4 | 103011013103000202113 |
5 | 132440224231044201 |
6 | 2442201130412555 |
7 | 163504540142462 |
oct | 23050723004227 |
9 | 4570302080288 |
10 | 1311161190551 |
11 | 466073345913 |
12 | 19214129115b |
13 | 9684653b3c4 |
14 | 47663a182d9 |
15 | 2418dc0491b |
hex | 131474c0897 |
1311161190551 has 4 divisors (see below), whose sum is σ = 1316788492032. Its totient is φ = 1305533889072.
The previous prime is 1311161190539. The next prime is 1311161190571. The reversal of 1311161190551 is 1550911611131.
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 1311161190551 - 230 = 1310087448727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311161190571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2813650391 + ... + 2813650856.
It is an arithmetic number, because the mean of its divisors is an integer number (329197123008).
Almost surely, 21311161190551 is an apocalyptic number.
1311161190551 is a deficient number, since it is larger than the sum of its proper divisors (5627301481).
1311161190551 is an equidigital number, since it uses as much as digits as its factorization.
1311161190551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5627301480.
The product of its (nonzero) digits is 4050, while the sum is 35.
The spelling of 1311161190551 in words is "one trillion, three hundred eleven billion, one hundred sixty-one million, one hundred ninety thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •