Base | Representation |
---|---|
bin | 1100111000011100111… |
… | …1000110000010011011 |
3 | 210011020121222021210002 |
4 | 3032013033012002123 |
5 | 12111221411310042 |
6 | 245400332443215 |
7 | 21663215526134 |
oct | 3160717060233 |
9 | 704217867702 |
10 | 221312213147 |
11 | 85948a7a3a3 |
12 | 36a8501950b |
13 | 17b3c819a9c |
14 | a9d6786c8b |
15 | 5b544e4132 |
hex | 33873c609b |
221312213147 has 2 divisors, whose sum is σ = 221312213148. Its totient is φ = 221312213146.
The previous prime is 221312213039. The next prime is 221312213149. The reversal of 221312213147 is 741312213122.
It is a happy number.
221312213147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221312213147 is a prime.
Together with 221312213149, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (221312213149) 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, 110656106573 + 110656106574.
It is an arithmetic number, because the mean of its divisors is an integer number (110656106574).
Almost surely, 2221312213147 is an apocalyptic number.
221312213147 is a deficient number, since it is larger than the sum of its proper divisors (1).
221312213147 is an equidigital number, since it uses as much as digits as its factorization.
221312213147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4032, while the sum is 29.
Adding to 221312213147 its reverse (741312213122), we get a palindrome (962624426269).
The spelling of 221312213147 in words is "two hundred twenty-one billion, three hundred twelve million, two hundred thirteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •