Base | Representation |
---|---|
bin | 1000101001011000100000… |
… | …01001101100100111011100 |
3 | 2111022201200201010001100220 |
4 | 10110230100021230213130 |
5 | 4443011324321300032 |
6 | 104234541454521340 |
7 | 4001502622330341 |
oct | 424542011544734 |
9 | 74281621101326 |
10 | 19014091196892 |
11 | 6070915869a10 |
12 | 2171084806250 |
13 | a7c0374a7a2c |
14 | 49a40346a7c8 |
15 | 22e90076912c |
hex | 114b1026c9dc |
19014091196892 has 48 divisors (see below), whose sum is σ = 48444780720000. Its totient is φ = 5756455834560.
The previous prime is 19014091196887. The next prime is 19014091196921. The reversal of 19014091196892 is 29869119041091.
It is a super-2 number, since 2×190140911968922 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67233142 + ... + 67515357.
It is an arithmetic number, because the mean of its divisors is an integer number (1009266265000).
Almost surely, 219014091196892 is an apocalyptic number.
19014091196892 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
19014091196892 is an abundant number, since it is smaller than the sum of its proper divisors (29430689523108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19014091196892 is a wasteful number, since it uses less digits than its factorization.
19014091196892 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134749586 (or 134749584 counting only the distinct ones).
The product of its (nonzero) digits is 2519424, while the sum is 60.
The spelling of 19014091196892 in words is "nineteen trillion, fourteen billion, ninety-one million, one hundred ninety-six thousand, eight hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •