Base | Representation |
---|---|
bin | 1110111000011101001100… |
… | …0001100011111010000001 |
3 | 2010221021221112121002010222 |
4 | 3232013103001203322001 |
5 | 4121043032113113012 |
6 | 54445031352032425 |
7 | 3306123102122432 |
oct | 356072301437201 |
9 | 63837845532128 |
10 | 16363070832257 |
11 | 52395a299a526 |
12 | 1a03333392715 |
13 | 919053028bb6 |
14 | 407d966b7489 |
15 | 1d59936c3972 |
hex | ee1d3063e81 |
16363070832257 has 2 divisors, whose sum is σ = 16363070832258. Its totient is φ = 16363070832256.
The previous prime is 16363070832247. The next prime is 16363070832271. The reversal of 16363070832257 is 75223807036361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8935788939841 + 7427281892416 = 2989279^2 + 2725304^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16363070832257 is a prime.
It is a super-2 number, since 2×163630708322572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16363070832199 and 16363070832208.
It is not a weakly prime, because it can be changed into another prime (16363070832247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8181535416128 + 8181535416129.
It is an arithmetic number, because the mean of its divisors is an integer number (8181535416129).
Almost surely, 216363070832257 is an apocalyptic number.
It is an amenable number.
16363070832257 is a deficient number, since it is larger than the sum of its proper divisors (1).
16363070832257 is an equidigital number, since it uses as much as digits as its factorization.
16363070832257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7620480, while the sum is 53.
The spelling of 16363070832257 in words is "sixteen trillion, three hundred sixty-three billion, seventy million, eight hundred thirty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •