Base | Representation |
---|---|
bin | 1001000000101110000111… |
… | …01100110011111100010100 |
3 | 2121011101110211201211221110 |
4 | 10200113003230303330110 |
5 | 10044131100131100120 |
6 | 110051155121415020 |
7 | 4113441101046666 |
oct | 440270354637424 |
9 | 77141424654843 |
10 | 19815967440660 |
11 | 634a9a5023396 |
12 | 228057349a470 |
13 | b0983a08ac01 |
14 | 4c7152a74536 |
15 | 2456d36252e0 |
hex | 1205c3b33f14 |
19815967440660 has 24 divisors (see below), whose sum is σ = 55484708834016. Its totient is φ = 5284257984160.
The previous prime is 19815967440629. The next prime is 19815967440667. The reversal of 19815967440660 is 6604476951891.
It is a junction number, because it is equal to n+sod(n) for n = 19815967440591 and 19815967440600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19815967440667) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 165133061946 + ... + 165133062065.
It is an arithmetic number, because the mean of its divisors is an integer number (2311862868084).
Almost surely, 219815967440660 is an apocalyptic number.
19815967440660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19815967440660 is an abundant number, since it is smaller than the sum of its proper divisors (35668741393356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19815967440660 is a wasteful number, since it uses less digits than its factorization.
19815967440660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330266124023 (or 330266124021 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 66.
The spelling of 19815967440660 in words is "nineteen trillion, eight hundred fifteen billion, nine hundred sixty-seven million, four hundred forty thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •