Base | Representation |
---|---|
bin | 1110011110011111010101… |
… | …0001011001101000000101 |
3 | 2002100122110220221101010212 |
4 | 3213213311101121220011 |
5 | 4041240423003423023 |
6 | 53504053213325205 |
7 | 3231651216401264 |
oct | 347476521315005 |
9 | 62318426841125 |
10 | 15916968811013 |
11 | 5087391a37226 |
12 | 1950994796805 |
13 | 8b5c6b39ba5a |
14 | 3d055777c5db |
15 | 1c9084756e78 |
hex | e79f5459a05 |
15916968811013 has 2 divisors, whose sum is σ = 15916968811014. Its totient is φ = 15916968811012.
The previous prime is 15916968810997. The next prime is 15916968811097. The reversal of 15916968811013 is 31011886961951.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14932335320644 + 984633490369 = 3864238^2 + 992287^2 .
It is a cyclic number.
It is not a de Polignac number, because 15916968811013 - 24 = 15916968810997 is a prime.
It is a super-2 number, since 2×159169688110132 (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 (15916968819013) 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, 7958484405506 + 7958484405507.
It is an arithmetic number, because the mean of its divisors is an integer number (7958484405507).
Almost surely, 215916968811013 is an apocalyptic number.
It is an amenable number.
15916968811013 is a deficient number, since it is larger than the sum of its proper divisors (1).
15916968811013 is an equidigital number, since it uses as much as digits as its factorization.
15916968811013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 59.
The spelling of 15916968811013 in words is "fifteen trillion, nine hundred sixteen billion, nine hundred sixty-eight million, eight hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •