Base | Representation |
---|---|
bin | 111011000100110… |
… | …0110001000101110 |
3 | 12010010220120020110 |
4 | 1312021212020232 |
5 | 13024422230430 |
6 | 524410000450 |
7 | 100056436302 |
oct | 16611461056 |
9 | 5103816213 |
10 | 1982226990 |
11 | 927a08527 |
12 | 473a16126 |
13 | 2578937a3 |
14 | 14b38dd02 |
15 | b90517b0 |
hex | 7626622e |
1982226990 has 64 divisors (see below), whose sum is σ = 4834432512. Its totient is φ = 520060800.
The previous prime is 1982226929. The next prime is 1982226997. The reversal of 1982226990 is 996222891.
It is a happy number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1982226997) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1816345 + ... + 1817435.
It is an arithmetic number, because the mean of its divisors is an integer number (75538008).
Almost surely, 21982226990 is an apocalyptic number.
1982226990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1982226990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2417216256).
1982226990 is an abundant number, since it is smaller than the sum of its proper divisors (2852205522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1982226990 is a wasteful number, since it uses less digits than its factorization.
1982226990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2025.
The product of its (nonzero) digits is 279936, while the sum is 48.
The square root of 1982226990 is about 44522.2078293519. The cubic root of 1982226990 is about 1256.1778416512.
The spelling of 1982226990 in words is "one billion, nine hundred eighty-two million, two hundred twenty-six thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •