Base | Representation |
---|---|
bin | 1111001011001011000101… |
… | …1100111001100100100101 |
3 | 2012002000221120010102211011 |
4 | 3302302301130321210211 |
5 | 4141330110302330431 |
6 | 55252451355342221 |
7 | 3341265455021422 |
oct | 362626134714445 |
9 | 65060846112734 |
10 | 16684630120741 |
11 | 5352a03810310 |
12 | 1a55714a51971 |
13 | 94047a5b282b |
14 | 41977cc38d49 |
15 | 1de013959cb1 |
hex | f2cb1739925 |
16684630120741 has 16 divisors (see below), whose sum is σ = 18899046230400. Its totient is φ = 14590374635200.
The previous prime is 16684630120729. The next prime is 16684630120759. The reversal of 16684630120741 is 14702103648661.
It is a cyclic number.
It is not a de Polignac number, because 16684630120741 - 215 = 16684630087973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16684630120721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97131505 + ... + 97303126.
It is an arithmetic number, because the mean of its divisors is an integer number (1181190389400).
Almost surely, 216684630120741 is an apocalyptic number.
16684630120741 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16684630120741 is a deficient number, since it is larger than the sum of its proper divisors (2214416109659).
16684630120741 is a wasteful number, since it uses less digits than its factorization.
16684630120741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194434940.
The product of its (nonzero) digits is 1161216, while the sum is 49.
The spelling of 16684630120741 in words is "sixteen trillion, six hundred eighty-four billion, six hundred thirty million, one hundred twenty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •