Base | Representation |
---|---|
bin | 1000101110101100010010… |
… | …11101110101110010000000 |
3 | 2111222011120010221212220001 |
4 | 10113112021131311302000 |
5 | 10004003430334200010 |
6 | 104454431325125344 |
7 | 4020621353324131 |
oct | 427261135656200 |
9 | 74864503855801 |
10 | 19196515146880 |
11 | 6131218391645 |
12 | 21a04b60b9854 |
13 | a932ba3721c6 |
14 | 4a518b15bc88 |
15 | 23452ab79c3a |
hex | 117589775c80 |
19196515146880 has 32 divisors (see below), whose sum is σ = 45891669024540. Its totient is φ = 7678606058496.
The previous prime is 19196515146871. The next prime is 19196515146931. The reversal of 19196515146880 is 8864151569191.
It can be written as a sum of positive squares in 2 ways, for example, as 19196385551424 + 129595456 = 4381368^2 + 11384^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (64).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14997276819 + ... + 14997278098.
Almost surely, 219196515146880 is an apocalyptic number.
19196515146880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19196515146880 is an abundant number, since it is smaller than the sum of its proper divisors (26695153877660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19196515146880 is an equidigital number, since it uses as much as digits as its factorization.
19196515146880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29994554936 (or 29994554924 counting only the distinct ones).
The product of its (nonzero) digits is 18662400, while the sum is 64.
The spelling of 19196515146880 in words is "nineteen trillion, one hundred ninety-six billion, five hundred fifteen million, one hundred forty-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •