Base | Representation |
---|---|
bin | 1110111101111011010110… |
… | …0110001110000111011001 |
3 | 2011021021120020211222112101 |
4 | 3233132311212032013121 |
5 | 4124113033000000421 |
6 | 55000134423243401 |
7 | 3315661306250200 |
oct | 357366546160731 |
9 | 64237506758471 |
10 | 16457066406361 |
11 | 5275447a51579 |
12 | 1a195a62a9561 |
13 | 924b828801b9 |
14 | 40c7520d6237 |
15 | 1d81456ee191 |
hex | ef7b598e1d9 |
16457066406361 has 9 divisors (see below), whose sum is σ = 19143967424511. Its totient is φ = 14106032579352.
The previous prime is 16457066406271. The next prime is 16457066406377. The reversal of 16457066406361 is 16360466075461.
The square root of 16457066406361 is 4056731.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 9989423966025 + 6467642440336 = 3160605^2 + 2543156^2 .
It is not a de Polignac number, because 16457066406361 - 213 = 16457066398169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16457066406161) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 28107351 + ... + 28686883.
Almost surely, 216457066406361 is an apocalyptic number.
16457066406361 is the 4056731-st square number.
16457066406361 is the 2028366-th centered octagonal number.
It is an amenable number.
16457066406361 is a deficient number, since it is larger than the sum of its proper divisors (2686901018150).
16457066406361 is an frugal number, since it uses more digits than its factorization.
16457066406361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159080 (or 579540 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 55.
The spelling of 16457066406361 in words is "sixteen trillion, four hundred fifty-seven billion, sixty-six million, four hundred six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •