Base | Representation |
---|---|
bin | 1111000000100010100001… |
… | …1000110000100000110111 |
3 | 2011102120101201001210011220 |
4 | 3300020220120300200313 |
5 | 4130331434113230124 |
6 | 55032515405401423 |
7 | 3322140335021556 |
oct | 360105030604067 |
9 | 64376351053156 |
10 | 16501941930039 |
11 | 5292486018725 |
12 | 1a2622ab69273 |
13 | 929184a5aac7 |
14 | 4109ac001d9d |
15 | 1d93c0250879 |
hex | f0228630837 |
16501941930039 has 4 divisors (see below), whose sum is σ = 22002589240056. Its totient is φ = 11001294620024.
The previous prime is 16501941929983. The next prime is 16501941930043. The reversal of 16501941930039 is 93003914910561.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 16501941930039 - 29 = 16501941929527 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16501941929973 and 16501941930000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16501943930039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2750323655004 + ... + 2750323655009.
It is an arithmetic number, because the mean of its divisors is an integer number (5500647310014).
Almost surely, 216501941930039 is an apocalyptic number.
16501941930039 is a deficient number, since it is larger than the sum of its proper divisors (5500647310017).
16501941930039 is an equidigital number, since it uses as much as digits as its factorization.
16501941930039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5500647310016.
The product of its (nonzero) digits is 787320, while the sum is 51.
The spelling of 16501941930039 in words is "sixteen trillion, five hundred one billion, nine hundred forty-one million, nine hundred thirty thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •