Base | Representation |
---|---|
bin | 1110100110000000000100… |
… | …0000100011110001111111 |
3 | 2002210222120100121212121122 |
4 | 3221200001000203301333 |
5 | 4100344214233213011 |
6 | 54043234251421155 |
7 | 3244200126613250 |
oct | 351400100436177 |
9 | 62728510555548 |
10 | 16046014741631 |
11 | 5127093003966 |
12 | 19719a9a547bb |
13 | 8c51956c8494 |
14 | 3d68ba254b27 |
15 | 1cc5d895d3db |
hex | e9801023c7f |
16046014741631 has 8 divisors (see below), whose sum is σ = 18338712796704. Its totient is φ = 13753419245280.
The previous prime is 16046014741621. The next prime is 16046014741633. The reversal of 16046014741631 is 13614741064061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16046014741631 is a prime.
It is a super-2 number, since 2×160460147416312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16046014741633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25304120 + ... + 25930493.
It is an arithmetic number, because the mean of its divisors is an integer number (2292339099588).
Almost surely, 216046014741631 is an apocalyptic number.
16046014741631 is a deficient number, since it is larger than the sum of its proper divisors (2292698055073).
16046014741631 is an equidigital number, since it uses as much as digits as its factorization.
16046014741631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51279361.
The product of its (nonzero) digits is 290304, while the sum is 44.
The spelling of 16046014741631 in words is "sixteen trillion, forty-six billion, fourteen million, seven hundred forty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •