Base | Representation |
---|---|
bin | 10001110011000011000… |
… | …111000100011010001101 |
3 | 11022220220001021210220211 |
4 | 101303003013010122031 |
5 | 130014243243403003 |
6 | 2333505252042421 |
7 | 154235113336642 |
oct | 21630307043215 |
9 | 4286801253824 |
10 | 1223044122253 |
11 | 431765582228 |
12 | 17904b003411 |
13 | 8b442854ac5 |
14 | 432a4c1ddc9 |
15 | 21c32d1396d |
hex | 11cc31c468d |
1223044122253 has 2 divisors, whose sum is σ = 1223044122254. Its totient is φ = 1223044122252.
The previous prime is 1223044122217. The next prime is 1223044122271. The reversal of 1223044122253 is 3522214403221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 719507704644 + 503536417609 = 848238^2 + 709603^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1223044122253 is a prime.
It is a super-2 number, since 2×12230441222532 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1223044122953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611522061126 + 611522061127.
It is an arithmetic number, because the mean of its divisors is an integer number (611522061127).
Almost surely, 21223044122253 is an apocalyptic number.
It is an amenable number.
1223044122253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1223044122253 is an equidigital number, since it uses as much as digits as its factorization.
1223044122253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 1223044122253 its reverse (3522214403221), we get a palindrome (4745258525474).
The spelling of 1223044122253 in words is "one trillion, two hundred twenty-three billion, forty-four million, one hundred twenty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •