Base | Representation |
---|---|
bin | 1110101100000101000001… |
… | …1001111100011010101111 |
3 | 2010011222001221211221020212 |
4 | 3223001100121330122233 |
5 | 4104102033024330221 |
6 | 54203223035333035 |
7 | 3254554420015304 |
oct | 353012031743257 |
9 | 63158057757225 |
10 | 16150426011311 |
11 | 51673a2496189 |
12 | 198a088bb117b |
13 | 901c950b5667 |
14 | 3db9830c50ab |
15 | 1d019a0aab5b |
hex | eb05067c6af |
16150426011311 has 8 divisors (see below), whose sum is σ = 16339906128000. Its totient is φ = 15961574353752.
The previous prime is 16150426011283. The next prime is 16150426011337. The reversal of 16150426011311 is 11311062405161.
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 16150426011311 - 218 = 16150425749167 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 (16150426011341) 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, 157063085 + ... + 157165878.
It is an arithmetic number, because the mean of its divisors is an integer number (2042488266000).
Almost surely, 216150426011311 is an apocalyptic number.
16150426011311 is a deficient number, since it is larger than the sum of its proper divisors (189480116689).
16150426011311 is a wasteful number, since it uses less digits than its factorization.
16150426011311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314229565.
The product of its (nonzero) digits is 4320, while the sum is 32.
Adding to 16150426011311 its reverse (11311062405161), we get a palindrome (27461488416472).
The spelling of 16150426011311 in words is "sixteen trillion, one hundred fifty billion, four hundred twenty-six million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •