Base | Representation |
---|---|
bin | 111101001101110… |
… | …001101001010101 |
3 | 2122120112002111112 |
4 | 331031301221111 |
5 | 4100404141042 |
6 | 245524344405 |
7 | 34310352323 |
oct | 7515615125 |
9 | 2576462445 |
10 | 1027021397 |
11 | 4877aa416 |
12 | 247b45105 |
13 | 134a0b48c |
14 | 9a582d13 |
15 | 6026c982 |
hex | 3d371a55 |
1027021397 has 2 divisors, whose sum is σ = 1027021398. Its totient is φ = 1027021396.
The previous prime is 1027021379. The next prime is 1027021447. The reversal of 1027021397 is 7931207201.
Together with previous prime (1027021379) 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., 750431236 + 276590161 = 27394^2 + 16631^2 .
It is a cyclic number.
It is not a de Polignac number, because 1027021397 - 28 = 1027021141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1027021327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 513510698 + 513510699.
It is an arithmetic number, because the mean of its divisors is an integer number (513510699).
Almost surely, 21027021397 is an apocalyptic number.
It is an amenable number.
1027021397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1027021397 is an equidigital number, since it uses as much as digits as its factorization.
1027021397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 32.
The square root of 1027021397 is about 32047.1745556453. The cubic root of 1027021397 is about 1008.9272002777.
Adding to 1027021397 its reverse (7931207201), we get a palindrome (8958228598).
The spelling of 1027021397 in words is "one billion, twenty-seven million, twenty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •