Base | Representation |
---|---|
bin | 1110101001000001101100… |
… | …1000100001011001000000 |
3 | 2002222221201210012220102201 |
4 | 3222100123020201121000 |
5 | 4102222142104103120 |
6 | 54123152110322544 |
7 | 3251020156524550 |
oct | 352203310413100 |
9 | 62887653186381 |
10 | 16097992644160 |
11 | 51471361a03a9 |
12 | 197ba951b9454 |
13 | 8ca05a17651b |
14 | 3d920b52b160 |
15 | 1cdb2bc9d40a |
hex | ea41b221640 |
16097992644160 has 112 divisors (see below), whose sum is σ = 44234873070336. Its totient is φ = 5465726134272.
The previous prime is 16097992644143. The next prime is 16097992644161. The reversal of 16097992644160 is 6144629979061.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a junction number, because it is equal to n+sod(n) for n = 16097992644092 and 16097992644101.
It is not an unprimeable number, because it can be changed into a prime (16097992644161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34655707 + ... + 35117146.
Almost surely, 216097992644160 is an apocalyptic number.
16097992644160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16097992644160 is an abundant number, since it is smaller than the sum of its proper divisors (28136880426176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16097992644160 is a wasteful number, since it uses less digits than its factorization.
16097992644160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69772980 (or 69772970 counting only the distinct ones).
The product of its (nonzero) digits is 35271936, while the sum is 64.
The spelling of 16097992644160 in words is "sixteen trillion, ninety-seven billion, nine hundred ninety-two million, six hundred forty-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •