Base | Representation |
---|---|
bin | 10100010011010100110… |
… | …011101100111001000001 |
3 | 11221101002200112100012112 |
4 | 110103110303230321001 |
5 | 140324221232230123 |
6 | 2544530210105105 |
7 | 202536602004452 |
oct | 24232463547101 |
9 | 4841080470175 |
10 | 1395139726913 |
11 | 498748006179 |
12 | 1a647957b195 |
13 | a173a9bb23a |
14 | 4b74cd1b129 |
15 | 26456608d78 |
hex | 144d4cece41 |
1395139726913 has 2 divisors, whose sum is σ = 1395139726914. Its totient is φ = 1395139726912.
The previous prime is 1395139726829. The next prime is 1395139726999. The reversal of 1395139726913 is 3196279315931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 780496270849 + 614643456064 = 883457^2 + 783992^2 .
It is a cyclic number.
It is not a de Polignac number, because 1395139726913 - 218 = 1395139464769 is a prime.
It is a super-2 number, since 2×13951397269132 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1395139726313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 697569863456 + 697569863457.
It is an arithmetic number, because the mean of its divisors is an integer number (697569863457).
Almost surely, 21395139726913 is an apocalyptic number.
It is an amenable number.
1395139726913 is a deficient number, since it is larger than the sum of its proper divisors (1).
1395139726913 is an equidigital number, since it uses as much as digits as its factorization.
1395139726913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8266860, while the sum is 59.
The spelling of 1395139726913 in words is "one trillion, three hundred ninety-five billion, one hundred thirty-nine million, seven hundred twenty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •