Base | Representation |
---|---|
bin | 10011100010110010… |
… | …110110101001111100 |
3 | 2000011110200212221020 |
4 | 103202302312221330 |
5 | 320434110213233 |
6 | 13350150104140 |
7 | 1342011201546 |
oct | 234262665174 |
9 | 60143625836 |
10 | 20984851068 |
11 | 8999446225 |
12 | 409794b050 |
13 | 1c9573c74c |
14 | 103100c696 |
15 | 82c4589b3 |
hex | 4e2cb6a7c |
20984851068 has 48 divisors (see below), whose sum is σ = 51929811360. Its totient is φ = 6572703744.
The previous prime is 20984851061. The next prime is 20984851127. The reversal of 20984851068 is 86015848902.
It is a super-2 number, since 2×209848510682 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 20984851068.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20984851061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41148 + ... + 208956.
It is an arithmetic number, because the mean of its divisors is an integer number (1081871070).
Almost surely, 220984851068 is an apocalyptic number.
It is an amenable number.
20984851068 is an abundant number, since it is smaller than the sum of its proper divisors (30944960292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20984851068 is a wasteful number, since it uses less digits than its factorization.
20984851068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168446 (or 168444 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 51.
The spelling of 20984851068 in words is "twenty billion, nine hundred eighty-four million, eight hundred fifty-one thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •