Base | Representation |
---|---|
bin | 111111011111001… |
… | …100100111000001 |
3 | 2202020020212010102 |
4 | 333133030213001 |
5 | 4140134031341 |
6 | 253405412145 |
7 | 35252364236 |
oct | 7737144701 |
9 | 2666225112 |
10 | 1065142721 |
11 | 4a7277545 |
12 | 25886a055 |
13 | 13c897b86 |
14 | a166778d |
15 | 6379cc9b |
hex | 3f7cc9c1 |
1065142721 has 2 divisors, whose sum is σ = 1065142722. Its totient is φ = 1065142720.
The previous prime is 1065142703. The next prime is 1065142739. The reversal of 1065142721 is 1272415601.
It is a balanced prime because it is at equal distance from previous prime (1065142703) and next prime (1065142739).
It can be written as a sum of positive squares in only one way, i.e., 1065108496 + 34225 = 32636^2 + 185^2 .
It is an emirp because it is prime and its reverse (1272415601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1065142721 - 26 = 1065142657 is a prime.
It is a super-2 number, since 2×10651427212 = 2269058032198567682, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1065142621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532571360 + 532571361.
It is an arithmetic number, because the mean of its divisors is an integer number (532571361).
Almost surely, 21065142721 is an apocalyptic number.
It is an amenable number.
1065142721 is a deficient number, since it is larger than the sum of its proper divisors (1).
1065142721 is an equidigital number, since it uses as much as digits as its factorization.
1065142721 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 1065142721 is about 32636.5243400703. The cubic root of 1065142721 is about 1021.2590888030.
The spelling of 1065142721 in words is "one billion, sixty-five million, one hundred forty-two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •