Base | Representation |
---|---|
bin | 10001110011000111000… |
… | …110111101010010110001 |
3 | 11022221001201111210222202 |
4 | 101303013012331102301 |
5 | 130014412431430334 |
6 | 2333520045512545 |
7 | 154236556451426 |
oct | 21630706752261 |
9 | 4287051453882 |
10 | 1223111201969 |
11 | 43179a429208 |
12 | 179069572755 |
13 | 8b453710347 |
14 | 432adac1d4d |
15 | 21c38b6417e |
hex | 11cc71bd4b1 |
1223111201969 has 2 divisors, whose sum is σ = 1223111201970. Its totient is φ = 1223111201968.
The previous prime is 1223111201957. The next prime is 1223111202007. The reversal of 1223111201969 is 9691021113221.
It is an a-pointer prime, because the next prime (1223111202007) can be obtained adding 1223111201969 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1114475041969 + 108636160000 = 1055687^2 + 329600^2 .
It is a cyclic number.
It is not a de Polignac number, because 1223111201969 - 28 = 1223111201713 is a prime.
It is a super-2 number, since 2×12231112019692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1223111201929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611555600984 + 611555600985.
It is an arithmetic number, because the mean of its divisors is an integer number (611555600985).
Almost surely, 21223111201969 is an apocalyptic number.
It is an amenable number.
1223111201969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1223111201969 is an equidigital number, since it uses as much as digits as its factorization.
1223111201969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 38.
The spelling of 1223111201969 in words is "one trillion, two hundred twenty-three billion, one hundred eleven million, two hundred one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •