Base | Representation |
---|---|
bin | 10001110011000001001… |
… | …100111011001101101001 |
3 | 11022220210211001001210012 |
4 | 101303001030323031221 |
5 | 130014212044244032 |
6 | 2333502145501305 |
7 | 154234244231255 |
oct | 21630114731551 |
9 | 4286724031705 |
10 | 1223012103017 |
11 | 4317494a2751 |
12 | 179040341835 |
13 | 8b439023a03 |
14 | 432a0887265 |
15 | 21c300db6b2 |
hex | 11cc133b369 |
1223012103017 has 2 divisors, whose sum is σ = 1223012103018. Its totient is φ = 1223012103016.
The previous prime is 1223012102941. The next prime is 1223012103037. The reversal of 1223012103017 is 7103012103221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1113835387456 + 109176715561 = 1055384^2 + 330419^2 .
It is an emirp because it is prime and its reverse (7103012103221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1223012103017 - 28 = 1223012102761 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1223012102983 and 1223012103001.
It is not a weakly prime, because it can be changed into another prime (1223012103037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611506051508 + 611506051509.
It is an arithmetic number, because the mean of its divisors is an integer number (611506051509).
Almost surely, 21223012103017 is an apocalyptic number.
It is an amenable number.
1223012103017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1223012103017 is an equidigital number, since it uses as much as digits as its factorization.
1223012103017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 1223012103017 its reverse (7103012103221), we get a palindrome (8326024206238).
The spelling of 1223012103017 in words is "one trillion, two hundred twenty-three billion, twelve million, one hundred three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •