Base | Representation |
---|---|
bin | 111111010000010… |
… | …001110111100001 |
3 | 2201221220011202111 |
4 | 333100101313201 |
5 | 4133133411342 |
6 | 253145515321 |
7 | 35204216062 |
oct | 7720216741 |
9 | 2657804674 |
10 | 1061232097 |
11 | 4a5046422 |
12 | 2574a2b41 |
13 | 13bb28bb3 |
14 | a0d2a569 |
15 | 63279217 |
hex | 3f411de1 |
1061232097 has 2 divisors, whose sum is σ = 1061232098. Its totient is φ = 1061232096.
The previous prime is 1061232079. The next prime is 1061232143. The reversal of 1061232097 is 7902321601.
Together with previous prime (1061232079) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 549386721 + 511845376 = 23439^2 + 22624^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1061232097 is a prime.
It is a super-2 number, since 2×10612320972 = 2252427127406034818, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1061232047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530616048 + 530616049.
It is an arithmetic number, because the mean of its divisors is an integer number (530616049).
Almost surely, 21061232097 is an apocalyptic number.
It is an amenable number.
1061232097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061232097 is an equidigital number, since it uses as much as digits as its factorization.
1061232097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 31.
The square root of 1061232097 is about 32576.5574761975. The cubic root of 1061232097 is about 1020.0077203696.
Adding to 1061232097 its reverse (7902321601), we get a palindrome (8963553698).
The spelling of 1061232097 in words is "one billion, sixty-one million, two hundred thirty-two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •