Base | Representation |
---|---|
bin | 1001101110101001… |
… | …00110001000000101 |
3 | 111111000012122100211 |
4 | 10313110212020011 |
5 | 41144104110341 |
6 | 2222141235421 |
7 | 243301505224 |
oct | 46724461005 |
9 | 14430178324 |
10 | 5223113221 |
11 | 22403472a7 |
12 | 1019262b71 |
13 | 653149351 |
14 | 37797ccbb |
15 | 208829181 |
hex | 137526205 |
5223113221 has 2 divisors, whose sum is σ = 5223113222. Its totient is φ = 5223113220.
The previous prime is 5223113219. The next prime is 5223113267. The reversal of 5223113221 is 1223113225.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2908444900 + 2314668321 = 53930^2 + 48111^2 .
It is a cyclic number.
It is not a de Polignac number, because 5223113221 - 21 = 5223113219 is a prime.
Together with 5223113219, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5223113192 and 5223113201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5223113521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2611556610 + 2611556611.
It is an arithmetic number, because the mean of its divisors is an integer number (2611556611).
Almost surely, 25223113221 is an apocalyptic number.
It is an amenable number.
5223113221 is a deficient number, since it is larger than the sum of its proper divisors (1).
5223113221 is an equidigital number, since it uses as much as digits as its factorization.
5223113221 is an evil number, because the sum of its binary digits is even.
The product of its digits is 720, while the sum is 22.
The square root of 5223113221 is about 72271.1091723380. The cubic root of 5223113221 is about 1735.0412856324.
Adding to 5223113221 its reverse (1223113225), we get a palindrome (6446226446).
The spelling of 5223113221 in words is "five billion, two hundred twenty-three million, one hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •