Base | Representation |
---|---|
bin | 10001101001110011101… |
… | …010010000000001110101 |
3 | 11021222021111121210212112 |
4 | 101221303222100001311 |
5 | 124333433013424023 |
6 | 2325144502100405 |
7 | 153434163225464 |
oct | 21516352200165 |
9 | 4258244553775 |
10 | 1213121233013 |
11 | 428533345718 |
12 | 17713ba1a705 |
13 | 8a520b25901 |
14 | 42a030109db |
15 | 21851ad8478 |
hex | 11a73a90075 |
1213121233013 has 2 divisors, whose sum is σ = 1213121233014. Its totient is φ = 1213121233012.
The previous prime is 1213121232997. The next prime is 1213121233033. The reversal of 1213121233013 is 3103321213121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1159752378724 + 53368854289 = 1076918^2 + 231017^2 .
It is a cyclic number.
It is not a de Polignac number, because 1213121233013 - 24 = 1213121232997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1213121233013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1213121233033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606560616506 + 606560616507.
It is an arithmetic number, because the mean of its divisors is an integer number (606560616507).
Almost surely, 21213121233013 is an apocalyptic number.
It is an amenable number.
1213121233013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213121233013 is an equidigital number, since it uses as much as digits as its factorization.
1213121233013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1213121233013 its reverse (3103321213121), we get a palindrome (4316442446134).
The spelling of 1213121233013 in words is "one trillion, two hundred thirteen billion, one hundred twenty-one million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •