Base | Representation |
---|---|
bin | 1110111101000100100110… |
… | …1011110010001101100001 |
3 | 2011012212122002220012021222 |
4 | 3233101021223302031201 |
5 | 4123342433440224323 |
6 | 54545304310224425 |
7 | 3314631165461045 |
oct | 357211153621541 |
9 | 64185562805258 |
10 | 16442371023713 |
11 | 526a196878038 |
12 | 1a16784955115 |
13 | 92368018a7cb |
14 | 40bb5a528025 |
15 | 1d7a8550b9c8 |
hex | ef449af2361 |
16442371023713 has 2 divisors, whose sum is σ = 16442371023714. Its totient is φ = 16442371023712.
The previous prime is 16442371023677. The next prime is 16442371023737. The reversal of 16442371023713 is 31732017324461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14025751539409 + 2416619484304 = 3745097^2 + 1554548^2 .
It is a cyclic number.
It is not a de Polignac number, because 16442371023713 - 212 = 16442371019617 is a prime.
It is a super-3 number, since 3×164423710237133 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (16442371023413) 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, 8221185511856 + 8221185511857.
It is an arithmetic number, because the mean of its divisors is an integer number (8221185511857).
Almost surely, 216442371023713 is an apocalyptic number.
It is an amenable number.
16442371023713 is a deficient number, since it is larger than the sum of its proper divisors (1).
16442371023713 is an equidigital number, since it uses as much as digits as its factorization.
16442371023713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 508032, while the sum is 44.
The spelling of 16442371023713 in words is "sixteen trillion, four hundred forty-two billion, three hundred seventy-one million, twenty-three thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •