Base | Representation |
---|---|
bin | 111110111100101… |
… | …011010111001001 |
3 | 2201121020010010022 |
4 | 332330223113021 |
5 | 4130324444031 |
6 | 252443430225 |
7 | 35112435131 |
oct | 7674532711 |
9 | 2647203108 |
10 | 1056093641 |
11 | 4a2156869 |
12 | 255825375 |
13 | 13aa4a0a5 |
14 | a038dac1 |
15 | 62ab197b |
hex | 3ef2b5c9 |
1056093641 has 2 divisors, whose sum is σ = 1056093642. Its totient is φ = 1056093640.
The previous prime is 1056093617. The next prime is 1056093659. The reversal of 1056093641 is 1463906501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 988788025 + 67305616 = 31445^2 + 8204^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056093641 - 214 = 1056077257 is a prime.
It is a super-3 number, since 3×10560936413 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1056093041) 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 as a sum of consecutive naturals, namely, 528046820 + 528046821.
It is an arithmetic number, because the mean of its divisors is an integer number (528046821).
Almost surely, 21056093641 is an apocalyptic number.
It is an amenable number.
1056093641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056093641 is an equidigital number, since it uses as much as digits as its factorization.
1056093641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 1056093641 is about 32497.5943878928. The cubic root of 1056093641 is about 1018.3587732049.
The spelling of 1056093641 in words is "one billion, fifty-six million, ninety-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •