Base | Representation |
---|---|
bin | 111111011111000… |
… | …111011001110101 |
3 | 2202020012202212122 |
4 | 333133013121311 |
5 | 4140132341042 |
6 | 253405125325 |
7 | 35252245124 |
oct | 7737073165 |
9 | 2666182778 |
10 | 1065121397 |
11 | 4a726251a |
12 | 258859845 |
13 | 13c88b262 |
14 | a165dabb |
15 | 637967d2 |
hex | 3f7c7675 |
1065121397 has 2 divisors, whose sum is σ = 1065121398. Its totient is φ = 1065121396.
The previous prime is 1065121391. The next prime is 1065121429. The reversal of 1065121397 is 7931215601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1044970276 + 20151121 = 32326^2 + 4489^2 .
It is an emirp because it is prime and its reverse (7931215601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1065121397 - 218 = 1064859253 is a prime.
It is a super-2 number, since 2×10651213972 = 2268967180694463218, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1065121391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532560698 + 532560699.
It is an arithmetic number, because the mean of its divisors is an integer number (532560699).
Almost surely, 21065121397 is an apocalyptic number.
It is an amenable number.
1065121397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1065121397 is an equidigital number, since it uses as much as digits as its factorization.
1065121397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 35.
The square root of 1065121397 is about 32636.1976492360. The cubic root of 1065121397 is about 1021.2522736054.
Adding to 1065121397 its reverse (7931215601), we get a palindrome (8996336998).
The spelling of 1065121397 in words is "one billion, sixty-five million, one hundred twenty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •