Base | Representation |
---|---|
bin | 11100100100001111110… |
… | …011101100101110100000 |
3 | 20221200000101121220122000 |
4 | 130210033303230232200 |
5 | 224130324201440211 |
6 | 4101453021244000 |
7 | 261553405303050 |
oct | 34441763545640 |
9 | 6850011556560 |
10 | 1963065265056 |
11 | 69759318a855 |
12 | 278556703600 |
13 | 11316856791c |
14 | 6b027437560 |
15 | 360e567c656 |
hex | 1c90fcecba0 |
1963065265056 has 192 divisors, whose sum is σ = 6641217192960. Its totient is φ = 552504395520.
The previous prime is 1963065265037. The next prime is 1963065265067. The reversal of 1963065265056 is 6505625603691.
1963065265056 is a `hidden beast` number, since 1 + 9 + 63 + 0 + 6 + 526 + 5 + 0 + 56 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 1963065264993 and 1963065265011.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2017030 + ... + 2827461.
It is an arithmetic number, because the mean of its divisors is an integer number (34589672880).
Almost surely, 21963065265056 is an apocalyptic number.
1963065265056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1963065265056 is an abundant number, since it is smaller than the sum of its proper divisors (4678151927904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1963065265056 is a wasteful number, since it uses less digits than its factorization.
1963065265056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4844584 (or 4844570 counting only the distinct ones).
The product of its (nonzero) digits is 8748000, while the sum is 54.
The spelling of 1963065265056 in words is "one trillion, nine hundred sixty-three billion, sixty-five million, two hundred sixty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •