Base | Representation |
---|---|
bin | 11001001011001100… |
… | …100111101011010101 |
3 | 2120202212100120011021 |
4 | 121023030213223111 |
5 | 420330014400341 |
6 | 20230144441141 |
7 | 1644602064514 |
oct | 311314475325 |
9 | 76685316137 |
10 | 27031403221 |
11 | 10511582369 |
12 | 52a49191b1 |
13 | 271a357464 |
14 | 144609867b |
15 | a831d99d1 |
hex | 64b327ad5 |
27031403221 has 2 divisors, whose sum is σ = 27031403222. Its totient is φ = 27031403220.
The previous prime is 27031403207. The next prime is 27031403261. The reversal of 27031403221 is 12230413072.
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., 25925508196 + 1105895025 = 161014^2 + 33255^2 .
It is a cyclic number.
It is not a de Polignac number, because 27031403221 - 219 = 27030878933 is a prime.
It is a super-3 number, since 3×270314032213 (a number of 32 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27031403261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13515701610 + 13515701611.
It is an arithmetic number, because the mean of its divisors is an integer number (13515701611).
Almost surely, 227031403221 is an apocalyptic number.
It is an amenable number.
27031403221 is a deficient number, since it is larger than the sum of its proper divisors (1).
27031403221 is an equidigital number, since it uses as much as digits as its factorization.
27031403221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 25.
Adding to 27031403221 its reverse (12230413072), we get a palindrome (39261816293).
The spelling of 27031403221 in words is "twenty-seven billion, thirty-one million, four hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •