Base | Representation |
---|---|
bin | 1000101010010011010100… |
… | …01001111000111111010000 |
3 | 2111102202012012121121200211 |
4 | 10111021222021320333100 |
5 | 4444021010441434310 |
6 | 104301242543453504 |
7 | 4004001233422003 |
oct | 425115211707720 |
9 | 74382165547624 |
10 | 19045665968080 |
11 | 6083248a12934 |
12 | 2177216bb7294 |
13 | a81cc9bb14ab |
14 | 49bb5aabd53a |
15 | 23064c75bc8a |
hex | 11526a278fd0 |
19045665968080 has 40 divisors (see below), whose sum is σ = 46885948283592. Its totient is φ = 7170133069824.
The previous prime is 19045665967997. The next prime is 19045665968101. The reversal of 19045665968080 is 8086956654091.
It can be written as a sum of positive squares in 4 ways, for example, as 970311681936 + 18075354286144 = 985044^2 + 4251512^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 19045665967997 and 19045665968015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7002081717 + ... + 7002084436.
Almost surely, 219045665968080 is an apocalyptic number.
19045665968080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19045665968080 is an abundant number, since it is smaller than the sum of its proper divisors (27840282315512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19045665968080 is a wasteful number, since it uses less digits than its factorization.
19045665968080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14004166183 (or 14004166177 counting only the distinct ones).
The product of its (nonzero) digits is 111974400, while the sum is 67.
The spelling of 19045665968080 in words is "nineteen trillion, forty-five billion, six hundred sixty-five million, nine hundred sixty-eight thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •