Base | Representation |
---|---|
bin | 11110101110011011110… |
… | …10001010100101000111 |
3 | 10201221000001101012001201 |
4 | 33113031322022211013 |
5 | 114244104210030422 |
6 | 2124554121003331 |
7 | 136162523143552 |
oct | 17271572124507 |
9 | 3657001335051 |
10 | 1055721564487 |
11 | 377802334037 |
12 | 150733023547 |
13 | 78728516a85 |
14 | 391509c7699 |
15 | 1c6dd594727 |
hex | f5cde8a947 |
1055721564487 has 4 divisors (see below), whose sum is σ = 1060252558560. Its totient is φ = 1051190570416.
The previous prime is 1055721564463. The next prime is 1055721564629. The reversal of 1055721564487 is 7844651275501.
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 1055721564487 - 223 = 1055713175879 is a prime.
It is a super-2 number, since 2×10557215644872 (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 (1055721561487) 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, 2265496687 + ... + 2265497152.
It is an arithmetic number, because the mean of its divisors is an integer number (265063139640).
Almost surely, 21055721564487 is an apocalyptic number.
1055721564487 is a deficient number, since it is larger than the sum of its proper divisors (4530994073).
1055721564487 is an equidigital number, since it uses as much as digits as its factorization.
1055721564487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4530994072.
The product of its (nonzero) digits is 9408000, while the sum is 55.
The spelling of 1055721564487 in words is "one trillion, fifty-five billion, seven hundred twenty-one million, five hundred sixty-four thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •