Base | Representation |
---|---|
bin | 1110111000100111000110… |
… | …0110011100011010010101 |
3 | 2010221112210221201220011211 |
4 | 3232021301212130122111 |
5 | 4121114004203113023 |
6 | 54450151351101421 |
7 | 3306246035542213 |
oct | 356116146343225 |
9 | 63845727656154 |
10 | 16365731301013 |
11 | 523a738736036 |
12 | 1a03956371871 |
13 | 919388281273 |
14 | 408169b79cb3 |
15 | 1d5a9c04aa0d |
hex | ee27199c695 |
16365731301013 has 2 divisors, whose sum is σ = 16365731301014. Its totient is φ = 16365731301012.
The previous prime is 16365731300999. The next prime is 16365731301071. The reversal of 16365731301013 is 31010313756361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14211640847889 + 2154090453124 = 3769833^2 + 1467682^2 .
It is a cyclic number.
It is not a de Polignac number, because 16365731301013 - 237 = 16228292347541 is a prime.
It is a super-2 number, since 2×163657313010132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16365731301313) 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, 8182865650506 + 8182865650507.
It is an arithmetic number, because the mean of its divisors is an integer number (8182865650507).
Almost surely, 216365731301013 is an apocalyptic number.
It is an amenable number.
16365731301013 is a deficient number, since it is larger than the sum of its proper divisors (1).
16365731301013 is an equidigital number, since it uses as much as digits as its factorization.
16365731301013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102060, while the sum is 40.
The spelling of 16365731301013 in words is "sixteen trillion, three hundred sixty-five billion, seven hundred thirty-one million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •