Base | Representation |
---|---|
bin | 100101110010… |
… | …0101011001110 |
3 | 1101021111121120 |
4 | 1023210223032 |
5 | 20032423042 |
6 | 1544341410 |
7 | 330251040 |
oct | 113445316 |
9 | 41244546 |
10 | 19811022 |
11 | 10201350 |
12 | 6774866 |
13 | 41483ca |
14 | 28b9a90 |
15 | 1b14dec |
hex | 12e4ace |
19811022 has 64 divisors (see below), whose sum is σ = 49918464. Its totient is φ = 5091840.
The previous prime is 19811009. The next prime is 19811023. The reversal of 19811022 is 22011891.
It is a junction number, because it is equal to n+sod(n) for n = 19810983 and 19811001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19811023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63138 + ... + 63450.
It is an arithmetic number, because the mean of its divisors is an integer number (779976).
Almost surely, 219811022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19811022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24959232).
19811022 is an abundant number, since it is smaller than the sum of its proper divisors (30107442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19811022 is a wasteful number, since it uses less digits than its factorization.
19811022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473.
The product of its (nonzero) digits is 288, while the sum is 24.
The square root of 19811022 is about 4450.9574250941. The cubic root of 19811022 is about 270.5841126600.
It can be divided in two parts, 1981 and 1022, that added together give a palindrome (3003).
The spelling of 19811022 in words is "nineteen million, eight hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •