Base | Representation |
---|---|
bin | 10011100100010011001… |
… | …011000010000010101101 |
3 | 11202112202201110201102022 |
4 | 103210103023002002231 |
5 | 134012313441011301 |
6 | 2505415543235525 |
7 | 166101410003141 |
oct | 23442313020255 |
9 | 4675681421368 |
10 | 1344646422701 |
11 | 47929693a39a |
12 | 198727448ba5 |
13 | 99a5199c03a |
14 | 4911cc99221 |
15 | 24e9d7bed1b |
hex | 139132c20ad |
1344646422701 has 2 divisors, whose sum is σ = 1344646422702. Its totient is φ = 1344646422700.
The previous prime is 1344646422683. The next prime is 1344646422703. The reversal of 1344646422701 is 1072246464431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 940056289225 + 404590133476 = 969565^2 + 636074^2 .
It is a cyclic number.
It is not a de Polignac number, because 1344646422701 - 214 = 1344646406317 is a prime.
It is a Sophie Germain prime.
Together with 1344646422703, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1344646422703) 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, 672323211350 + 672323211351.
It is an arithmetic number, because the mean of its divisors is an integer number (672323211351).
Almost surely, 21344646422701 is an apocalyptic number.
It is an amenable number.
1344646422701 is a deficient number, since it is larger than the sum of its proper divisors (1).
1344646422701 is an equidigital number, since it uses as much as digits as its factorization.
1344646422701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 774144, while the sum is 44.
The spelling of 1344646422701 in words is "one trillion, three hundred forty-four billion, six hundred forty-six million, four hundred twenty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •