Base | Representation |
---|---|
bin | 10100010111001110111… |
… | …100011101011110010101 |
3 | 11221202221011011201100122 |
4 | 110113032330131132111 |
5 | 140411320044431221 |
6 | 2550502441521325 |
7 | 203045600345351 |
oct | 24271674353625 |
9 | 4852834151318 |
10 | 1399336327061 |
11 | 49a50096aa62 |
12 | 1a724aaa3245 |
13 | a1c592765aa |
14 | 4ba2a40a461 |
15 | 265eec65eab |
hex | 145cef1d795 |
1399336327061 has 2 divisors, whose sum is σ = 1399336327062. Its totient is φ = 1399336327060.
The previous prime is 1399336327057. The next prime is 1399336327091. The reversal of 1399336327061 is 1607236339931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 995666704561 + 403669622500 = 997831^2 + 635350^2 .
It is a cyclic number.
It is not a de Polignac number, because 1399336327061 - 22 = 1399336327057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1399336326994 and 1399336327012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1399336327091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 699668163530 + 699668163531.
It is an arithmetic number, because the mean of its divisors is an integer number (699668163531).
Almost surely, 21399336327061 is an apocalyptic number.
It is an amenable number.
1399336327061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1399336327061 is an equidigital number, since it uses as much as digits as its factorization.
1399336327061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3306744, while the sum is 53.
The spelling of 1399336327061 in words is "one trillion, three hundred ninety-nine billion, three hundred thirty-six million, three hundred twenty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •