Base | Representation |
---|---|
bin | 10011001000001010111… |
… | …011010001010101010111 |
3 | 11122122210210222020010211 |
4 | 103020022323101111113 |
5 | 133013434441132411 |
6 | 2443502533430251 |
7 | 163652062502263 |
oct | 23101273212527 |
9 | 4578723866124 |
10 | 1314443302231 |
11 | 4674a7a81a04 |
12 | 1928b849b387 |
13 | 96c4a4c9517 |
14 | 478958990a3 |
15 | 242d1e22221 |
hex | 1320aed1557 |
1314443302231 has 2 divisors, whose sum is σ = 1314443302232. Its totient is φ = 1314443302230.
The previous prime is 1314443302229. The next prime is 1314443302241. The reversal of 1314443302231 is 1322033444131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1314443302231 - 21 = 1314443302229 is a prime.
It is a super-2 number, since 2×13144433022312 (a number of 25 digits) contains 22 as substring.
Together with 1314443302229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1314443302193 and 1314443302202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1314443302241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657221651115 + 657221651116.
It is an arithmetic number, because the mean of its divisors is an integer number (657221651116).
Almost surely, 21314443302231 is an apocalyptic number.
1314443302231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314443302231 is an equidigital number, since it uses as much as digits as its factorization.
1314443302231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 1314443302231 its reverse (1322033444131), we get a palindrome (2636476746362).
The spelling of 1314443302231 in words is "one trillion, three hundred fourteen billion, four hundred forty-three million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •