Base | Representation |
---|---|
bin | 111110111010110… |
… | …101110010110001 |
3 | 2201120022122112202 |
4 | 332322311302301 |
5 | 4130214041311 |
6 | 252425232545 |
7 | 35105361146 |
oct | 7672656261 |
9 | 2646278482 |
10 | 1055612081 |
11 | 4a1957a87 |
12 | 255632755 |
13 | 13a90bb44 |
14 | a02a63cd |
15 | 62a18e3b |
hex | 3eeb5cb1 |
1055612081 has 2 divisors, whose sum is σ = 1055612082. Its totient is φ = 1055612080.
The previous prime is 1055612039. The next prime is 1055612113. The reversal of 1055612081 is 1802165501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 966215056 + 89397025 = 31084^2 + 9455^2 .
It is a cyclic number.
It is not a de Polignac number, because 1055612081 - 210 = 1055611057 is a prime.
It is a super-2 number, since 2×10556120812 = 2228633731106301122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1055612581) 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, 527806040 + 527806041.
It is an arithmetic number, because the mean of its divisors is an integer number (527806041).
Almost surely, 21055612081 is an apocalyptic number.
It is an amenable number.
1055612081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055612081 is an equidigital number, since it uses as much as digits as its factorization.
1055612081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 29.
The square root of 1055612081 is about 32490.1843792860. The cubic root of 1055612081 is about 1018.2039651498.
Adding to 1055612081 its reverse (1802165501), we get a palindrome (2857777582).
The spelling of 1055612081 in words is "one billion, fifty-five million, six hundred twelve thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •