Base | Representation |
---|---|
bin | 1110101100000101000001… |
… | …1001111100011011001001 |
3 | 2010011222001221211221021211 |
4 | 3223001100121330123021 |
5 | 4104102033024330322 |
6 | 54203223035333121 |
7 | 3254554420015342 |
oct | 353012031743311 |
9 | 63158057757254 |
10 | 16150426011337 |
11 | 51673a2496202 |
12 | 198a088bb11a1 |
13 | 901c950b5687 |
14 | 3db9830c50c9 |
15 | 1d019a0aab77 |
hex | eb05067c6c9 |
16150426011337 has 2 divisors, whose sum is σ = 16150426011338. Its totient is φ = 16150426011336.
The previous prime is 16150426011283. The next prime is 16150426011341. The reversal of 16150426011337 is 73311062405161.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13363967016976 + 2786458994361 = 3655676^2 + 1669269^2 .
It is a cyclic number.
It is not a de Polignac number, because 16150426011337 - 215 = 16150425978569 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16150426011337.
It is not a weakly prime, because it can be changed into another prime (16150426011397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8075213005668 + 8075213005669.
It is an arithmetic number, because the mean of its divisors is an integer number (8075213005669).
Almost surely, 216150426011337 is an apocalyptic number.
It is an amenable number.
16150426011337 is a deficient number, since it is larger than the sum of its proper divisors (1).
16150426011337 is an equidigital number, since it uses as much as digits as its factorization.
16150426011337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 40.
Adding to 16150426011337 its reverse (73311062405161), we get a palindrome (89461488416498).
The spelling of 16150426011337 in words is "sixteen trillion, one hundred fifty billion, four hundred twenty-six million, eleven thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •