Base | Representation |
---|---|
bin | 10001101001111001000… |
… | …101110000110000111101 |
3 | 11021222111212001001220121 |
4 | 101221321011300300331 |
5 | 124334124324043234 |
6 | 2325201514414541 |
7 | 153436350443464 |
oct | 21517105606075 |
9 | 4258455031817 |
10 | 1213212331069 |
11 | 42857a806a72 |
12 | 177166431451 |
13 | 8a53697059b |
14 | 42a111659db |
15 | 21859ad04b4 |
hex | 11a79170c3d |
1213212331069 has 2 divisors, whose sum is σ = 1213212331070. Its totient is φ = 1213212331068.
The previous prime is 1213212331003. The next prime is 1213212331103. The reversal of 1213212331069 is 9601332123121.
It is an a-pointer prime, because the next prime (1213212331103) can be obtained adding 1213212331069 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 993121868025 + 220090463044 = 996555^2 + 469138^2 .
It is a cyclic number.
It is not a de Polignac number, because 1213212331069 - 213 = 1213212322877 is a prime.
It is a super-2 number, since 2×12132123310692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1213212331169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606606165534 + 606606165535.
It is an arithmetic number, because the mean of its divisors is an integer number (606606165535).
Almost surely, 21213212331069 is an apocalyptic number.
It is an amenable number.
1213212331069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213212331069 is an equidigital number, since it uses as much as digits as its factorization.
1213212331069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 34.
The spelling of 1213212331069 in words is "one trillion, two hundred thirteen billion, two hundred twelve million, three hundred thirty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •