Base | Representation |
---|---|
bin | 1110100101101111110110… |
… | …1001001101110101111001 |
3 | 2002210120100002122221010122 |
4 | 3221123331221031311321 |
5 | 4100311311302323023 |
6 | 54041234405423025 |
7 | 3243654241305122 |
oct | 351337551156571 |
9 | 62716302587118 |
10 | 16041663323513 |
11 | 512525a817043 |
12 | 1970b9470aa75 |
13 | 8c4951045269 |
14 | 3d65c6385049 |
15 | 1cc43191e2c8 |
hex | e96fda4dd79 |
16041663323513 has 2 divisors, whose sum is σ = 16041663323514. Its totient is φ = 16041663323512.
The previous prime is 16041663323471. The next prime is 16041663323561. The reversal of 16041663323513 is 31532336614061.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9487305541609 + 6554357781904 = 3080147^2 + 2560148^2 .
It is a cyclic number.
It is not a de Polignac number, because 16041663323513 - 224 = 16041646546297 is a prime.
It is a super-2 number, since 2×160416633235132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16041663323563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8020831661756 + 8020831661757.
It is an arithmetic number, because the mean of its divisors is an integer number (8020831661757).
Almost surely, 216041663323513 is an apocalyptic number.
It is an amenable number.
16041663323513 is a deficient number, since it is larger than the sum of its proper divisors (1).
16041663323513 is an equidigital number, since it uses as much as digits as its factorization.
16041663323513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 699840, while the sum is 44.
Adding to 16041663323513 its reverse (31532336614061), we get a palindrome (47573999937574).
The spelling of 16041663323513 in words is "sixteen trillion, forty-one billion, six hundred sixty-three million, three hundred twenty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •