Base | Representation |
---|---|
bin | 1110100101111100000000… |
… | …0111100001000111001101 |
3 | 2002210212202111001102220000 |
4 | 3221133000013201013031 |
5 | 4100340002031443134 |
6 | 54042534241114513 |
7 | 3244131140063412 |
oct | 351370007410715 |
9 | 62725674042800 |
10 | 16044926046669 |
11 | 5126684510263 |
12 | 1971745328a39 |
13 | 8c5050ca5390 |
14 | 3d681581a109 |
15 | 1cc5730abe99 |
hex | e97c01e11cd |
16044926046669 has 80 divisors (see below), whose sum is σ = 25970700515760. Its totient is φ = 9813299973120.
The previous prime is 16044926046629. The next prime is 16044926046679. The reversal of 16044926046669 is 96664062944061.
It can be written as a sum of positive squares in 8 ways, for example, as 2412548284644 + 13632377762025 = 1553238^2 + 3692205^2 .
It is not a de Polignac number, because 16044926046669 - 211 = 16044926044621 is a prime.
It is a super-2 number, since 2×160449260466692 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16044926046629) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 115032679 + ... + 115172075.
It is an arithmetic number, because the mean of its divisors is an integer number (324633756447).
Almost surely, 216044926046669 is an apocalyptic number.
It is an amenable number.
16044926046669 is a deficient number, since it is larger than the sum of its proper divisors (9925774469091).
16044926046669 is a wasteful number, since it uses less digits than its factorization.
16044926046669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140092 (or 140083 counting only the distinct ones).
The product of its (nonzero) digits is 80621568, while the sum is 63.
The spelling of 16044926046669 in words is "sixteen trillion, forty-four billion, nine hundred twenty-six million, forty-six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •