Base | Representation |
---|---|
bin | 11101010010001100001… |
… | …001110111101111101101 |
3 | 21010101100100021120221022 |
4 | 131102030021313233231 |
5 | 230432341344424042 |
6 | 4140252040143525 |
7 | 265251023360105 |
oct | 35221411675755 |
9 | 7111310246838 |
10 | 2012396092397 |
11 | 7064a8149549 |
12 | 286023467ba5 |
13 | 1179ca79c9a2 |
14 | 6d586d36205 |
15 | 375313ddcd2 |
hex | 1d48c277bed |
2012396092397 has 2 divisors, whose sum is σ = 2012396092398. Its totient is φ = 2012396092396.
The previous prime is 2012396092379. The next prime is 2012396092451. The reversal of 2012396092397 is 7932906932102.
Together with previous prime (2012396092379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1681018564681 + 331377527716 = 1296541^2 + 575654^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012396092397 - 212 = 2012396088301 is a prime.
It is a super-2 number, since 2×20123960923972 (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 (2012396092367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006198046198 + 1006198046199.
It is an arithmetic number, because the mean of its divisors is an integer number (1006198046199).
Almost surely, 22012396092397 is an apocalyptic number.
It is an amenable number.
2012396092397 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012396092397 is an equidigital number, since it uses as much as digits as its factorization.
2012396092397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2204496, while the sum is 53.
The spelling of 2012396092397 in words is "two trillion, twelve billion, three hundred ninety-six million, ninety-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •