Base | Representation |
---|---|
bin | 110011111011… |
… | …0000001010101 |
3 | 1220020000200222 |
4 | 1213312001111 |
5 | 23432101401 |
6 | 2411244125 |
7 | 450245504 |
oct | 147660125 |
9 | 56200628 |
10 | 27222101 |
11 | 14403405 |
12 | 9149645 |
13 | 584176a |
14 | 388883b |
15 | 25cac1b |
hex | 19f6055 |
27222101 has 2 divisors, whose sum is σ = 27222102. Its totient is φ = 27222100.
The previous prime is 27222031. The next prime is 27222103. The reversal of 27222101 is 10122272.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22791076 + 4431025 = 4774^2 + 2105^2 .
It is a cyclic number.
It is not a de Polignac number, because 27222101 - 218 = 26959957 is a prime.
Together with 27222103, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 27222101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27222103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13611050 + 13611051.
It is an arithmetic number, because the mean of its divisors is an integer number (13611051).
Almost surely, 227222101 is an apocalyptic number.
It is an amenable number.
27222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
27222101 is an equidigital number, since it uses as much as digits as its factorization.
27222101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 17.
The square root of 27222101 is about 5217.4803305810. The cubic root of 27222101 is about 300.8203509990.
Adding to 27222101 its reverse (10122272), we get a palindrome (37344373).
The spelling of 27222101 in words is "twenty-seven million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •