Base | Representation |
---|---|
bin | 100001101000101000011… |
… | …101000000110100000101 |
3 | 22011222001102111120121201 |
4 | 201220220131000310011 |
5 | 300332142000140042 |
6 | 4525455040142501 |
7 | 325663634115613 |
oct | 41505035006405 |
9 | 8158042446551 |
10 | 2311371099397 |
11 | 811279801398 |
12 | 313b61607a31 |
13 | 139c66150459 |
14 | 7dc29ca26b3 |
15 | 401cdad11b7 |
hex | 21a28740d05 |
2311371099397 has 2 divisors, whose sum is σ = 2311371099398. Its totient is φ = 2311371099396.
The previous prime is 2311371099379. The next prime is 2311371099403. The reversal of 2311371099397 is 7939901731132.
Together with previous prime (2311371099379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1614523468321 + 696847631076 = 1270639^2 + 834774^2 .
It is a cyclic number.
It is not a de Polignac number, because 2311371099397 - 239 = 1761615285509 is a prime.
It is a super-3 number, since 3×23113710993973 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2311371099797) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1155685549698 + 1155685549699.
It is an arithmetic number, because the mean of its divisors is an integer number (1155685549699).
Almost surely, 22311371099397 is an apocalyptic number.
It is an amenable number.
2311371099397 is a deficient number, since it is larger than the sum of its proper divisors (1).
2311371099397 is an equidigital number, since it uses as much as digits as its factorization.
2311371099397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1928934, while the sum is 55.
The spelling of 2311371099397 in words is "two trillion, three hundred eleven billion, three hundred seventy-one million, ninety-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •