Base | Representation |
---|---|
bin | 1110100110100001101110… |
… | …0011110011011100100100 |
3 | 2002211211220001021210210200 |
4 | 3221220123203303130210 |
5 | 4101021220312414134 |
6 | 54051331015150500 |
7 | 3244640052235152 |
oct | 351503343633444 |
9 | 62754801253720 |
10 | 16055050123044 |
11 | 512a9aa270729 |
12 | 19736ab975430 |
13 | 8c5ca55b600a |
14 | 3d70d623a3d2 |
15 | 1cc966cc8499 |
hex | e9a1b8f3724 |
16055050123044 has 72 divisors (see below), whose sum is σ = 41984676584760. Its totient is φ = 5166940326912.
The previous prime is 16055050123043. The next prime is 16055050123067. The reversal of 16055050123044 is 44032105055061.
16055050123044 is a `hidden beast` number, since 1 + 6 + 0 + 550 + 50 + 12 + 3 + 0 + 44 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 3661214364900 + 12393835758144 = 1913430^2 + 3520488^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (16055050123043) 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 23 ways as a sum of consecutive naturals, for example, 27625842 + ... + 28201014.
Almost surely, 216055050123044 is an apocalyptic number.
It is an amenable number.
16055050123044 is an abundant number, since it is smaller than the sum of its proper divisors (25929626461716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16055050123044 is a wasteful number, since it uses less digits than its factorization.
16055050123044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601949 (or 601944 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 16055050123044 in words is "sixteen trillion, fifty-five billion, fifty million, one hundred twenty-three thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •