Base | Representation |
---|---|
bin | 10011101111111010110… |
… | …000100111011100000101 |
3 | 11210201222010222211201001 |
4 | 103233322300213130011 |
5 | 134213341131343233 |
6 | 2515241512533301 |
7 | 200022512341126 |
oct | 23577260473405 |
9 | 4721863884631 |
10 | 1357121746693 |
11 | 483608933a09 |
12 | 19b0293b1231 |
13 | 9ac8c45905b |
14 | 49983a8804d |
15 | 2547db3227d |
hex | 13bfac27705 |
1357121746693 has 2 divisors, whose sum is σ = 1357121746694. Its totient is φ = 1357121746692.
The previous prime is 1357121746667. The next prime is 1357121746741. The reversal of 1357121746693 is 3966471217531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 818883826084 + 538237920609 = 904922^2 + 733647^2 .
It is an emirp because it is prime and its reverse (3966471217531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1357121746693 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1357121746663) 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, 678560873346 + 678560873347.
It is an arithmetic number, because the mean of its divisors is an integer number (678560873347).
Almost surely, 21357121746693 is an apocalyptic number.
It is an amenable number.
1357121746693 is a deficient number, since it is larger than the sum of its proper divisors (1).
1357121746693 is an equidigital number, since it uses as much as digits as its factorization.
1357121746693 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5715360, while the sum is 55.
The spelling of 1357121746693 in words is "one trillion, three hundred fifty-seven billion, one hundred twenty-one million, seven hundred forty-six thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •