Base | Representation |
---|---|
bin | 11110101111011110100… |
… | …11111010010101000101 |
3 | 10201222110002212022122122 |
4 | 33113233103322111011 |
5 | 114301231140234142 |
6 | 2125125500135325 |
7 | 136212436351136 |
oct | 17275723722505 |
9 | 3658402768578 |
10 | 1056281961797 |
11 | 377a6a6a2907 |
12 | 15086a837545 |
13 | 787b765790a |
14 | 391a51c1c8d |
15 | 1c72288d1d2 |
hex | f5ef4fa545 |
1056281961797 has 4 divisors (see below), whose sum is σ = 1111875749280. Its totient is φ = 1000688174316.
The previous prime is 1056281961751. The next prime is 1056281961827. The reversal of 1056281961797 is 7971691826501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1056281961797 - 224 = 1056265184581 is a prime.
It is a super-2 number, since 2×10562819617972 (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 (1056281961737) 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, 27796893713 + ... + 27796893750.
It is an arithmetic number, because the mean of its divisors is an integer number (277968937320).
Almost surely, 21056281961797 is an apocalyptic number.
It is an amenable number.
1056281961797 is a deficient number, since it is larger than the sum of its proper divisors (55593787483).
1056281961797 is an equidigital number, since it uses as much as digits as its factorization.
1056281961797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55593787482.
The product of its (nonzero) digits is 11430720, while the sum is 62.
The spelling of 1056281961797 in words is "one trillion, fifty-six billion, two hundred eighty-one million, nine hundred sixty-one thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •