Base | Representation |
---|---|
bin | 100100010000001… |
… | …0110101110100101 |
3 | 10010202221121200202 |
4 | 1020200112232211 |
5 | 4442402110003 |
6 | 320412320245 |
7 | 42100402646 |
oct | 11040265645 |
9 | 3122847622 |
10 | 1216441253 |
11 | 574716355 |
12 | 29b473085 |
13 | 16502cb31 |
14 | b77ad6cd |
15 | 71bd7088 |
hex | 48816ba5 |
1216441253 has 2 divisors, whose sum is σ = 1216441254. Its totient is φ = 1216441252.
The previous prime is 1216441249. The next prime is 1216441297. The reversal of 1216441253 is 3521446121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 893232769 + 323208484 = 29887^2 + 17978^2 .
It is a cyclic number.
It is not a de Polignac number, because 1216441253 - 22 = 1216441249 is a prime.
It is a super-3 number, since 3×12164412533 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1216441243) 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, 608220626 + 608220627.
It is an arithmetic number, because the mean of its divisors is an integer number (608220627).
Almost surely, 21216441253 is an apocalyptic number.
It is an amenable number.
1216441253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1216441253 is an equidigital number, since it uses as much as digits as its factorization.
1216441253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 29.
The square root of 1216441253 is about 34877.5178732662. The cubic root of 1216441253 is about 1067.4897491643.
Adding to 1216441253 its reverse (3521446121), we get a palindrome (4737887374).
The spelling of 1216441253 in words is "one billion, two hundred sixteen million, four hundred forty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •