Base | Representation |
---|---|
bin | 1110101111010111101010… |
… | …1101010111001010110100 |
3 | 2010101101000121221102001222 |
4 | 3223311322231113022310 |
5 | 4111013333400211130 |
6 | 54245213540205512 |
7 | 3261625555504010 |
oct | 353657255271264 |
9 | 63341017842058 |
10 | 16206970319540 |
11 | 5189379259930 |
12 | 1999029699898 |
13 | 90740691aa00 |
14 | 4005c8a31540 |
15 | 1d18a9254ce5 |
hex | ebd7ab572b4 |
16206970319540 has 576 divisors, whose sum is σ = 46333555365888. Its totient is φ = 4624007731200.
The previous prime is 16206970319531. The next prime is 16206970319581. The reversal of 16206970319540 is 4591307960261.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 23454370595 + ... + 23454371285.
It is an arithmetic number, because the mean of its divisors is an integer number (80440200288).
Almost surely, 216206970319540 is an apocalyptic number.
16206970319540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16206970319540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23166777682944).
16206970319540 is an abundant number, since it is smaller than the sum of its proper divisors (30126585046348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16206970319540 is a wasteful number, since it uses less digits than its factorization.
16206970319540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368 (or 1353 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 53.
The spelling of 16206970319540 in words is "sixteen trillion, two hundred six billion, nine hundred seventy million, three hundred nineteen thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •