Base | Representation |
---|---|
bin | 10011010001011110110… |
… | …010000100100001110111 |
3 | 11200121121111201202000201 |
4 | 103101132302010201313 |
5 | 133144423132024343 |
6 | 2452234524021331 |
7 | 164454601124065 |
oct | 23213662044167 |
9 | 4617544652021 |
10 | 1324440111223 |
11 | 470767a07519 |
12 | 194828391847 |
13 | 97b8163a408 |
14 | 4816342b035 |
15 | 246b989e94d |
hex | 1345ec84877 |
1324440111223 has 2 divisors, whose sum is σ = 1324440111224. Its totient is φ = 1324440111222.
The previous prime is 1324440111209. The next prime is 1324440111283. The reversal of 1324440111223 is 3221110444231.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1324440111223 - 25 = 1324440111191 is a prime.
It is a super-3 number, since 3×13244401112233 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1324440111191 and 1324440111200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1324440111283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 662220055611 + 662220055612.
It is an arithmetic number, because the mean of its divisors is an integer number (662220055612).
Almost surely, 21324440111223 is an apocalyptic number.
1324440111223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1324440111223 is an equidigital number, since it uses as much as digits as its factorization.
1324440111223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1324440111223 its reverse (3221110444231), we get a palindrome (4545550555454).
The spelling of 1324440111223 in words is "one trillion, three hundred twenty-four billion, four hundred forty million, one hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •