Base | Representation |
---|---|
bin | 10011000110110000111… |
… | …110100101010110110101 |
3 | 11122111220122100222012011 |
4 | 103012300332211112311 |
5 | 133002342130034422 |
6 | 2443053104524221 |
7 | 163566506513242 |
oct | 23066076452665 |
9 | 4574818328164 |
10 | 1312934221237 |
11 | 4668a315a031 |
12 | 192557020671 |
13 | 96a69977aa2 |
14 | 477912b05c9 |
15 | 242446d2077 |
hex | 131b0fa55b5 |
1312934221237 has 2 divisors, whose sum is σ = 1312934221238. Its totient is φ = 1312934221236.
The previous prime is 1312934221229. The next prime is 1312934221259. The reversal of 1312934221237 is 7321224392131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1306999984081 + 5934237156 = 1143241^2 + 77034^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312934221237 - 23 = 1312934221229 is a prime.
It is a super-3 number, since 3×13129342212373 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1312934221237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312934221037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656467110618 + 656467110619.
It is an arithmetic number, because the mean of its divisors is an integer number (656467110619).
Almost surely, 21312934221237 is an apocalyptic number.
It is an amenable number.
1312934221237 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312934221237 is an equidigital number, since it uses as much as digits as its factorization.
1312934221237 is an evil number, because the sum of its binary digits is even.
The product of its digits is 108864, while the sum is 40.
The spelling of 1312934221237 in words is "one trillion, three hundred twelve billion, nine hundred thirty-four million, two hundred twenty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •