Base | Representation |
---|---|
bin | 11110101111001101100… |
… | …10000101101001100111 |
3 | 10201222002010121212221211 |
4 | 33113212302011221213 |
5 | 114300433023040133 |
6 | 2125103345252251 |
7 | 136206051223651 |
oct | 17274662055147 |
9 | 3658063555854 |
10 | 1056138877543 |
11 | 3779a6954562 |
12 | 15082a934087 |
13 | 78793b0a789 |
14 | 391901b76d1 |
15 | 1c715027bcd |
hex | f5e6c85a67 |
1056138877543 has 4 divisors (see below), whose sum is σ = 1071902144440. Its totient is φ = 1040375610648.
The previous prime is 1056138877537. The next prime is 1056138877583. The reversal of 1056138877543 is 3457788316501.
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 1056138877543 - 25 = 1056138877511 is a prime.
It is a super-2 number, since 2×10561388775432 (a number of 25 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 (1056138877583) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7881633348 + ... + 7881633481.
It is an arithmetic number, because the mean of its divisors is an integer number (267975536110).
Almost surely, 21056138877543 is an apocalyptic number.
1056138877543 is a deficient number, since it is larger than the sum of its proper divisors (15763266897).
1056138877543 is an equidigital number, since it uses as much as digits as its factorization.
1056138877543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15763266896.
The product of its (nonzero) digits is 16934400, while the sum is 58.
The spelling of 1056138877543 in words is "one trillion, fifty-six billion, one hundred thirty-eight million, eight hundred seventy-seven thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •