Base | Representation |
---|---|
bin | 11101111011000000… |
… | …01101110110001101 |
3 | 1112110112200222221021 |
4 | 32331200031312031 |
5 | 230344421203122 |
6 | 11214012234141 |
7 | 1106041536655 |
oct | 167540156615 |
9 | 45415628837 |
10 | 16064241037 |
11 | 68a3933069 |
12 | 3143a6b951 |
13 | 1690189690 |
14 | ac56d5365 |
15 | 6404851c7 |
hex | 3bd80dd8d |
16064241037 has 16 divisors (see below), whose sum is σ = 17741288880. Its totient is φ = 14451033600.
The previous prime is 16064241031. The next prime is 16064241041. The reversal of 16064241037 is 73014246061.
It can be written as a sum of positive squares in 8 ways, for example, as 7973418436 + 8090822601 = 89294^2 + 89949^2 .
It is a cyclic number.
It is not a de Polignac number, because 16064241037 - 23 = 16064241029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16064240993 and 16064241011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16064241031) 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 15 ways as a sum of consecutive naturals, for example, 485539 + ... + 517567.
It is an arithmetic number, because the mean of its divisors is an integer number (1108830555).
Almost surely, 216064241037 is an apocalyptic number.
It is an amenable number.
16064241037 is a deficient number, since it is larger than the sum of its proper divisors (1677047843).
16064241037 is a wasteful number, since it uses less digits than its factorization.
16064241037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33024.
The product of its (nonzero) digits is 24192, while the sum is 34.
Adding to 16064241037 its reverse (73014246061), we get a palindrome (89078487098).
The spelling of 16064241037 in words is "sixteen billion, sixty-four million, two hundred forty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •