Base | Representation |
---|---|
bin | 1110111101100100101111… |
… | …0011111100010111110101 |
3 | 2011020200220020112111012010 |
4 | 3233121023303330113311 |
5 | 4124013120120322014 |
6 | 54553252235314433 |
7 | 3315355014216000 |
oct | 357311363742765 |
9 | 64220806474163 |
10 | 16450996651509 |
11 | 5272912807952 |
12 | 1a183915aba19 |
13 | 924426200394 |
14 | 40c337d2a537 |
15 | 1d7ddc8d8359 |
hex | ef64bcfc5f5 |
16450996651509 has 64 divisors (see below), whose sum is σ = 26439311360000. Its totient is φ = 9085481717760.
The previous prime is 16450996651501. The next prime is 16450996651651. The reversal of 16450996651509 is 90515669905461.
It is not a de Polignac number, because 16450996651509 - 23 = 16450996651501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16450996651509.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16450996651501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 24195012 + ... + 24865650.
It is an arithmetic number, because the mean of its divisors is an integer number (413114240000).
Almost surely, 216450996651509 is an apocalyptic number.
It is an amenable number.
16450996651509 is a deficient number, since it is larger than the sum of its proper divisors (9988314708491).
16450996651509 is an equidigital number, since it uses as much as digits as its factorization.
16450996651509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671463 (or 671449 counting only the distinct ones).
The product of its (nonzero) digits is 78732000, while the sum is 66.
The spelling of 16450996651509 in words is "sixteen trillion, four hundred fifty billion, nine hundred ninety-six million, six hundred fifty-one thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •