Base | Representation |
---|---|
bin | 1000111101100001110011… |
… | …11010000111011000111100 |
3 | 2120202220100122021020020200 |
4 | 10132300321322013120330 |
5 | 10040331431030134410 |
6 | 105524535111043500 |
7 | 4102506011622141 |
oct | 436607172073074 |
9 | 76686318236220 |
10 | 19706281489980 |
11 | 6308429183178 |
12 | 2263261970590 |
13 | acc3a996a807 |
14 | 4c1b094803c8 |
15 | 242913db43c0 |
hex | 11ec39e8763c |
19706281489980 has 36 divisors (see below), whose sum is σ = 59775720520152. Its totient is φ = 5255008397280.
The previous prime is 19706281489967. The next prime is 19706281490041. The reversal of 19706281489980 is 8998418260791.
19706281489980 is a `hidden beast` number, since 1 + 9 + 7 + 0 + 62 + 8 + 1 + 489 + 9 + 80 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 19706281489899 and 19706281489908.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54739670626 + ... + 54739670985.
Almost surely, 219706281489980 is an apocalyptic number.
19706281489980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19706281489980 is an abundant number, since it is smaller than the sum of its proper divisors (40069439030172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19706281489980 is a wasteful number, since it uses less digits than its factorization.
19706281489980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109479341626 (or 109479341621 counting only the distinct ones).
The product of its (nonzero) digits is 125411328, while the sum is 72.
The spelling of 19706281489980 in words is "nineteen trillion, seven hundred six billion, two hundred eighty-one million, four hundred eighty-nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •