Base | Representation |
---|---|
bin | 1110110101000000000010… |
… | …0001101011110000100001 |
3 | 2010201121201012201100201112 |
4 | 3231100000201223300201 |
5 | 4114104441344414401 |
6 | 54401452445313105 |
7 | 3301622000161604 |
oct | 355200041536041 |
9 | 63647635640645 |
10 | 16303704685601 |
11 | 52163a9292903 |
12 | 19b3925865795 |
13 | 9135819bb478 |
14 | 4051640a033b |
15 | 1d416b9293bb |
hex | ed40086bc21 |
16303704685601 has 2 divisors, whose sum is σ = 16303704685602. Its totient is φ = 16303704685600.
The previous prime is 16303704685591. The next prime is 16303704685627. The reversal of 16303704685601 is 10658640730361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16209440949025 + 94263736576 = 4026095^2 + 307024^2 .
It is a cyclic number.
It is not a de Polignac number, because 16303704685601 - 234 = 16286524816417 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16303704685601.
It is not a weakly prime, because it can be changed into another prime (16303704685651) 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, 8151852342800 + 8151852342801.
It is an arithmetic number, because the mean of its divisors is an integer number (8151852342801).
Almost surely, 216303704685601 is an apocalyptic number.
It is an amenable number.
16303704685601 is a deficient number, since it is larger than the sum of its proper divisors (1).
16303704685601 is an equidigital number, since it uses as much as digits as its factorization.
16303704685601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 16303704685601 in words is "sixteen trillion, three hundred three billion, seven hundred four million, six hundred eighty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •