Base | Representation |
---|---|
bin | 1111001100110011001100… |
… | …0011100110100111100001 |
3 | 2012011201002001002102022212 |
4 | 3303030303003212213201 |
5 | 4142304323012100421 |
6 | 55313352313011505 |
7 | 3343305112626266 |
oct | 363146303464741 |
9 | 65151061072285 |
10 | 16712574331361 |
11 | 5363843572357 |
12 | 1a5b0133b3b95 |
13 | 942cb1a98cbc |
14 | 41ac7022526d |
15 | 1deaebd50e5b |
hex | f33330e69e1 |
16712574331361 has 2 divisors, whose sum is σ = 16712574331362. Its totient is φ = 16712574331360.
The previous prime is 16712574331357. The next prime is 16712574331471. The reversal of 16712574331361 is 16313347521761.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13808767480225 + 2903806851136 = 3716015^2 + 1704056^2 .
It is a cyclic number.
It is not a de Polignac number, because 16712574331361 - 22 = 16712574331357 is a prime.
It is a super-2 number, since 2×167125743313612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16712574391361) 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, 8356287165680 + 8356287165681.
It is an arithmetic number, because the mean of its divisors is an integer number (8356287165681).
Almost surely, 216712574331361 is an apocalyptic number.
It is an amenable number.
16712574331361 is a deficient number, since it is larger than the sum of its proper divisors (1).
16712574331361 is an equidigital number, since it uses as much as digits as its factorization.
16712574331361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1905120, while the sum is 50.
The spelling of 16712574331361 in words is "sixteen trillion, seven hundred twelve billion, five hundred seventy-four million, three hundred thirty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •