Base | Representation |
---|---|
bin | 1110100111111010101111… |
… | …0001101111111001110000 |
3 | 2002221010120021211122201222 |
4 | 3221332223301233321300 |
5 | 4101414134300043003 |
6 | 54110322023244212 |
7 | 3246444143335220 |
oct | 351765361577160 |
9 | 62833507748658 |
10 | 16078944534128 |
11 | 513a051015403 |
12 | 1978259ba9668 |
13 | 8c8312a629b8 |
14 | 3d832182c080 |
15 | 1cd3b48adc38 |
hex | e9fabc6fe70 |
16078944534128 has 20 divisors (see below), whose sum is σ = 35603377182960. Its totient is φ = 6890976228864.
The previous prime is 16078944534127. The next prime is 16078944534131. The reversal of 16078944534128 is 82143544987061.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16078944534127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71781002273 + ... + 71781002496.
It is an arithmetic number, because the mean of its divisors is an integer number (1780168859148).
It is a 1-persistent number, because it is pandigital, but 2⋅16078944534128 = 32157889068256 is not.
Almost surely, 216078944534128 is an apocalyptic number.
It is an amenable number.
16078944534128 is an abundant number, since it is smaller than the sum of its proper divisors (19524432648832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16078944534128 is a wasteful number, since it uses less digits than its factorization.
16078944534128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143562004784 (or 143562004778 counting only the distinct ones).
The product of its (nonzero) digits is 46448640, while the sum is 62.
The spelling of 16078944534128 in words is "sixteen trillion, seventy-eight billion, nine hundred forty-four million, five hundred thirty-four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •