Base | Representation |
---|---|
bin | 1111000011101001000001… |
… | …0001011111101011110100 |
3 | 2011121122221001112222000221 |
4 | 3300322100101133223310 |
5 | 4132220044430322431 |
6 | 55113210511144124 |
7 | 3326034616053532 |
oct | 360722021375364 |
9 | 64548831488027 |
10 | 16555224464116 |
11 | 5303038686158 |
12 | 1a3461b215044 |
13 | 9311c68a5c90 |
14 | 4133c4683152 |
15 | 1da98cd98111 |
hex | f0e9045faf4 |
16555224464116 has 24 divisors (see below), whose sum is σ = 31205090442344. Its totient is φ = 7639682693760.
The previous prime is 16555224464059. The next prime is 16555224464117. The reversal of 16555224464116 is 61146442255561.
It can be written as a sum of positive squares in 4 ways, for example, as 979415039716 + 15575809424400 = 989654^2 + 3946620^2 .
It is a super-2 number, since 2×165552244641162 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16555224464117) 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 7 ways as a sum of consecutive naturals, for example, 24457395 + ... + 25125178.
Almost surely, 216555224464116 is an apocalyptic number.
It is an amenable number.
16555224464116 is a deficient number, since it is larger than the sum of its proper divisors (14649865978228).
16555224464116 is a wasteful number, since it uses less digits than its factorization.
16555224464116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49589011 (or 49589009 counting only the distinct ones).
The product of its digits is 6912000, while the sum is 52.
The spelling of 16555224464116 in words is "sixteen trillion, five hundred fifty-five billion, two hundred twenty-four million, four hundred sixty-four thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •