Base | Representation |
---|---|
bin | 1111000110100000010011… |
… | …1110101111100000101011 |
3 | 2011210100221002000222220101 |
4 | 3301220010332233200223 |
5 | 4134021331320411411 |
6 | 55151545111010231 |
7 | 3332426116545040 |
oct | 361500476574053 |
9 | 64710832028811 |
10 | 16604427122731 |
11 | 5321997263888 |
12 | 1a42071069977 |
13 | 935a383b3c66 |
14 | 41593113b1c7 |
15 | 1dbdbc73d8c1 |
hex | f1a04faf82b |
16604427122731 has 8 divisors (see below), whose sum is σ = 19038300807680. Its totient is φ = 14186006604648.
The previous prime is 16604427122729. The next prime is 16604427122737. The reversal of 16604427122731 is 13722172440661.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16604427122731 - 21 = 16604427122729 is a prime.
It is a super-2 number, since 2×166044271227312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16604427122737) 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 7 ways as a sum of consecutive naturals, for example, 3863289411 + ... + 3863293708.
It is an arithmetic number, because the mean of its divisors is an integer number (2379787600960).
Almost surely, 216604427122731 is an apocalyptic number.
16604427122731 is a deficient number, since it is larger than the sum of its proper divisors (2433873684949).
16604427122731 is an equidigital number, since it uses as much as digits as its factorization.
16604427122731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7726583433.
The product of its (nonzero) digits is 677376, while the sum is 46.
The spelling of 16604427122731 in words is "sixteen trillion, six hundred four billion, four hundred twenty-seven million, one hundred twenty-two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •