Base | Representation |
---|---|
bin | 10001101000001101001… |
… | …111101110100101010001 |
3 | 11021210211202110202002212 |
4 | 101220031033232211101 |
5 | 124321423132113431 |
6 | 2324302202321505 |
7 | 153343460432243 |
oct | 21501517564521 |
9 | 4253752422085 |
10 | 1211403004241 |
11 | 427831461a41 |
12 | 1769404b9295 |
13 | 8a308b661b1 |
14 | 428bcb42093 |
15 | 217a0d3372b |
hex | 11a0d3ee951 |
1211403004241 has 2 divisors, whose sum is σ = 1211403004242. Its totient is φ = 1211403004240.
The previous prime is 1211403004211. The next prime is 1211403004261. The reversal of 1211403004241 is 1424003041121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1176584937025 + 34818067216 = 1084705^2 + 186596^2 .
It is an emirp because it is prime and its reverse (1424003041121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1211403004241 - 222 = 1211398809937 is a prime.
It is a super-3 number, since 3×12114030042413 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1211403004211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605701502120 + 605701502121.
It is an arithmetic number, because the mean of its divisors is an integer number (605701502121).
Almost surely, 21211403004241 is an apocalyptic number.
It is an amenable number.
1211403004241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211403004241 is an equidigital number, since it uses as much as digits as its factorization.
1211403004241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1211403004241 its reverse (1424003041121), we get a palindrome (2635406045362).
The spelling of 1211403004241 in words is "one trillion, two hundred eleven billion, four hundred three million, four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •