Base | Representation |
---|---|
bin | 1000111011011010111011… |
… | …10111100110110111011100 |
3 | 2120111222110011222010010011 |
4 | 10131231131313212313130 |
5 | 10033140131303240340 |
6 | 105431401525253004 |
7 | 4064333416345033 |
oct | 435553567466734 |
9 | 76458404863104 |
10 | 19633870368220 |
11 | 628a74aa72699 |
12 | 2251213564164 |
13 | ac5609b421c4 |
14 | 4bc3da55171a |
15 | 240ac6c820ea |
hex | 11db5dde6ddc |
19633870368220 has 12 divisors (see below), whose sum is σ = 41231127773304. Its totient is φ = 7853548147280.
The previous prime is 19633870368197. The next prime is 19633870368223. The reversal of 19633870368220 is 2286307833691.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19633870368223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 490846759186 + ... + 490846759225.
It is an arithmetic number, because the mean of its divisors is an integer number (3435927314442).
Almost surely, 219633870368220 is an apocalyptic number.
19633870368220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19633870368220 is an abundant number, since it is smaller than the sum of its proper divisors (21597257405084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19633870368220 is a wasteful number, since it uses less digits than its factorization.
19633870368220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 981693518420 (or 981693518418 counting only the distinct ones).
The product of its (nonzero) digits is 15676416, while the sum is 58.
The spelling of 19633870368220 in words is "nineteen trillion, six hundred thirty-three billion, eight hundred seventy million, three hundred sixty-eight thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •