Base | Representation |
---|---|
bin | 1000110111110011001111… |
… | …10101010011001000001100 |
3 | 2120002002101110002200022210 |
4 | 10123321213311103020030 |
5 | 10024120410232434120 |
6 | 105254311042510420 |
7 | 4052341121310522 |
oct | 433714765231014 |
9 | 76062343080283 |
10 | 19509483483660 |
11 | 6241a1a8a7245 |
12 | 223109a665410 |
13 | ab6975b37771 |
14 | 4b639a746312 |
15 | 23c746ad3ce0 |
hex | 11be67d5320c |
19509483483660 has 48 divisors (see below), whose sum is σ = 54726419575296. Its totient is φ = 5193017898432.
The previous prime is 19509483483601. The next prime is 19509483483691. The reversal of 19509483483660 is 6638438490591.
It is a junction number, because it is equal to n+sod(n) for n = 19509483483591 and 19509483483600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 297186612 + ... + 297252251.
It is an arithmetic number, because the mean of its divisors is an integer number (1140133741152).
Almost surely, 219509483483660 is an apocalyptic number.
19509483483660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19509483483660 is an abundant number, since it is smaller than the sum of its proper divisors (35216936091636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19509483483660 is a wasteful number, since it uses less digits than its factorization.
19509483483660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 594439422 (or 594439420 counting only the distinct ones).
The product of its (nonzero) digits is 134369280, while the sum is 66.
The spelling of 19509483483660 in words is "nineteen trillion, five hundred nine billion, four hundred eighty-three million, four hundred eighty-three thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •