Base | Representation |
---|---|
bin | 1111001001011111010101… |
… | …0101100000001000011000 |
3 | 2011222021021200000112001221 |
4 | 3302113311111200020120 |
5 | 4140341340242324034 |
6 | 55231305214021424 |
7 | 3336222610203304 |
oct | 362276525401030 |
9 | 64867250015057 |
10 | 16655704261144 |
11 | 534170a929923 |
12 | 1a4bba17a7874 |
13 | 93a81a915b90 |
14 | 4181d731ad04 |
15 | 1dd3be2a9bb4 |
hex | f25f5560218 |
16655704261144 has 64 divisors (see below), whose sum is σ = 33994417897440. Its totient is φ = 7604418170880.
The previous prime is 16655704261061. The next prime is 16655704261199. The reversal of 16655704261144 is 44116240755661.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a junction number, because it is equal to n+sod(n) for n = 16655704261091 and 16655704261100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21110142 + ... + 21884914.
Almost surely, 216655704261144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16655704261144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16997208948720).
16655704261144 is an abundant number, since it is smaller than the sum of its proper divisors (17338713636296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16655704261144 is a wasteful number, since it uses less digits than its factorization.
16655704261144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 777020 (or 777016 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 52.
The spelling of 16655704261144 in words is "sixteen trillion, six hundred fifty-five billion, seven hundred four million, two hundred sixty-one thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •