Base | Representation |
---|---|
bin | 10100010011100001010… |
… | …100110010011000010101 |
3 | 11221101122022200102210221 |
4 | 110103201110302120111 |
5 | 140330134012223431 |
6 | 2545003111114341 |
7 | 202545031661035 |
oct | 24234124623025 |
9 | 4841568612727 |
10 | 1395349726741 |
11 | 4988455a9153 |
12 | 1a65179729b1 |
13 | a1772366ca9 |
14 | 4b76cb838c5 |
15 | 26469c8b111 |
hex | 144e1532615 |
1395349726741 has 2 divisors, whose sum is σ = 1395349726742. Its totient is φ = 1395349726740.
The previous prime is 1395349726733. The next prime is 1395349726769. The reversal of 1395349726741 is 1476279435931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1257650102500 + 137699624241 = 1121450^2 + 371079^2 .
It is a cyclic number.
It is not a de Polignac number, because 1395349726741 - 23 = 1395349726733 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1395349726741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1395349726721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 697674863370 + 697674863371.
It is an arithmetic number, because the mean of its divisors is an integer number (697674863371).
Almost surely, 21395349726741 is an apocalyptic number.
It is an amenable number.
1395349726741 is a deficient number, since it is larger than the sum of its proper divisors (1).
1395349726741 is an equidigital number, since it uses as much as digits as its factorization.
1395349726741 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34292160, while the sum is 61.
The spelling of 1395349726741 in words is "one trillion, three hundred ninety-five billion, three hundred forty-nine million, seven hundred twenty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •