Base | Representation |
---|---|
bin | 1110101011011111111011… |
… | …0001000100000010001101 |
3 | 2010011000100212002112120012 |
4 | 3222313332301010002031 |
5 | 4103421133344434032 |
6 | 54154454454403005 |
7 | 3254052542532566 |
oct | 352677661040215 |
9 | 63130325075505 |
10 | 16140466405517 |
11 | 5163151560a13 |
12 | 1988169660465 |
13 | 90106889c2ac |
14 | 3db2ba47916d |
15 | 1cecb5a2b6b2 |
hex | eadfec4408d |
16140466405517 has 2 divisors, whose sum is σ = 16140466405518. Its totient is φ = 16140466405516.
The previous prime is 16140466405493. The next prime is 16140466405543. The reversal of 16140466405517 is 71550466404161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15365976642916 + 774489762601 = 3919946^2 + 880051^2 .
It is an emirp because it is prime and its reverse (71550466404161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16140466405517 - 222 = 16140462211213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16140466465517) 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, 8070233202758 + 8070233202759.
It is an arithmetic number, because the mean of its divisors is an integer number (8070233202759).
Almost surely, 216140466405517 is an apocalyptic number.
It is an amenable number.
16140466405517 is a deficient number, since it is larger than the sum of its proper divisors (1).
16140466405517 is an equidigital number, since it uses as much as digits as its factorization.
16140466405517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2419200, while the sum is 50.
The spelling of 16140466405517 in words is "sixteen trillion, one hundred forty billion, four hundred sixty-six million, four hundred five thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •