Base | Representation |
---|---|
bin | 10001110100001110101… |
… | …001000011011111101001 |
3 | 11100001011100202021000001 |
4 | 101310032221003133221 |
5 | 130024342144310401 |
6 | 2334235120343001 |
7 | 154311401351413 |
oct | 21641651033751 |
9 | 4301140667001 |
10 | 1224311322601 |
11 | 432255907644 |
12 | 179343474a61 |
13 | 8b5b52476b3 |
14 | 433852439b3 |
15 | 21ca91c5601 |
hex | 11d0ea437e9 |
1224311322601 has 2 divisors, whose sum is σ = 1224311322602. Its totient is φ = 1224311322600.
The previous prime is 1224311322599. The next prime is 1224311322631. The reversal of 1224311322601 is 1062231134221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 964363280400 + 259948042201 = 982020^2 + 509851^2 .
It is a cyclic number.
It is not a de Polignac number, because 1224311322601 - 21 = 1224311322599 is a prime.
Together with 1224311322599, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1224311322601.
It is not a weakly prime, because it can be changed into another prime (1224311322631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 612155661300 + 612155661301.
It is an arithmetic number, because the mean of its divisors is an integer number (612155661301).
Almost surely, 21224311322601 is an apocalyptic number.
It is an amenable number.
1224311322601 is a deficient number, since it is larger than the sum of its proper divisors (1).
1224311322601 is an equidigital number, since it uses as much as digits as its factorization.
1224311322601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 1224311322601 its reverse (1062231134221), we get a palindrome (2286542456822).
The spelling of 1224311322601 in words is "one trillion, two hundred twenty-four billion, three hundred eleven million, three hundred twenty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •