Base | Representation |
---|---|
bin | 1110111100011111010100… |
… | …1100110000101011110001 |
3 | 2011011220210200021222010101 |
4 | 3233013311030300223301 |
5 | 4123211440044422012 |
6 | 54540531302032401 |
7 | 3314125201411333 |
oct | 357076514605361 |
9 | 64156720258111 |
10 | 16432363670257 |
11 | 5265a209a0297 |
12 | 1a14851418701 |
13 | 922746ac72a2 |
14 | 40b48b40d453 |
15 | 1d769bb99d57 |
hex | ef1f5330af1 |
16432363670257 has 16 divisors (see below), whose sum is σ = 18099276347520. Its totient is φ = 14890654350000.
The previous prime is 16432363670231. The next prime is 16432363670453. The reversal of 16432363670257 is 75207636323461.
It is not a de Polignac number, because 16432363670257 - 215 = 16432363637489 is a prime.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16432363670198 and 16432363670207.
It is not an unprimeable number, because it can be changed into a prime (16432363676257) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51923494 + ... + 52239007.
It is an arithmetic number, because the mean of its divisors is an integer number (1131204771720).
Almost surely, 216432363670257 is an apocalyptic number.
It is an amenable number.
16432363670257 is a deficient number, since it is larger than the sum of its proper divisors (1666912677263).
16432363670257 is an equidigital number, since it uses as much as digits as its factorization.
16432363670257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104162581 (or 104162543 counting only the distinct ones).
The product of its (nonzero) digits is 22861440, while the sum is 55.
The spelling of 16432363670257 in words is "sixteen trillion, four hundred thirty-two billion, three hundred sixty-three million, six hundred seventy thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •