Base | Representation |
---|---|
bin | 111100011010001… |
… | …1100001001010101 |
3 | 12020021011220200012 |
4 | 1320310130021111 |
5 | 13122403401233 |
6 | 533045530005 |
7 | 101142215666 |
oct | 17064341125 |
9 | 5207156605 |
10 | 2027012693 |
11 | 950217702 |
12 | 486a13905 |
13 | 263c446c4 |
14 | 1532cb36d |
15 | bce4b548 |
hex | 78d1c255 |
2027012693 has 2 divisors, whose sum is σ = 2027012694. Its totient is φ = 2027012692.
The previous prime is 2027012657. The next prime is 2027012749. The reversal of 2027012693 is 3962107202.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1960541284 + 66471409 = 44278^2 + 8153^2 .
It is a cyclic number.
It is not a de Polignac number, because 2027012693 - 216 = 2026947157 is a prime.
It is a super-2 number, since 2×20270126932 = 8217560915166224498, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2027017693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1013506346 + 1013506347.
It is an arithmetic number, because the mean of its divisors is an integer number (1013506347).
Almost surely, 22027012693 is an apocalyptic number.
It is an amenable number.
2027012693 is a deficient number, since it is larger than the sum of its proper divisors (1).
2027012693 is an equidigital number, since it uses as much as digits as its factorization.
2027012693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
The square root of 2027012693 is about 45022.3577014798. The cubic root of 2027012693 is about 1265.5680124992.
Adding to 2027012693 its reverse (3962107202), we get a palindrome (5989119895).
The spelling of 2027012693 in words is "two billion, twenty-seven million, twelve thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •