Base | Representation |
---|---|
bin | 10011111001101000000… |
… | …011110001101111101101 |
3 | 11211201212120222100102022 |
4 | 103321220003301233231 |
5 | 134401213111431111 |
6 | 2524124112235525 |
7 | 200542023165401 |
oct | 23715003615755 |
9 | 4751776870368 |
10 | 1367545420781 |
11 | 487a778135a1 |
12 | 1a105823bba5 |
13 | 9bc60b56647 |
14 | 4a2921b5101 |
15 | 2588dccd2db |
hex | 13e680f1bed |
1367545420781 has 2 divisors, whose sum is σ = 1367545420782. Its totient is φ = 1367545420780.
The previous prime is 1367545420757. The next prime is 1367545420823. The reversal of 1367545420781 is 1870245457631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 930194665156 + 437350755625 = 964466^2 + 661325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1367545420781 is a prime.
It is a super-2 number, since 2×13675454207812 (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 (1367545420481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 683772710390 + 683772710391.
It is an arithmetic number, because the mean of its divisors is an integer number (683772710391).
Almost surely, 21367545420781 is an apocalyptic number.
It is an amenable number.
1367545420781 is a deficient number, since it is larger than the sum of its proper divisors (1).
1367545420781 is an equidigital number, since it uses as much as digits as its factorization.
1367545420781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5644800, while the sum is 53.
The spelling of 1367545420781 in words is "one trillion, three hundred sixty-seven billion, five hundred forty-five million, four hundred twenty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •