Base | Representation |
---|---|
bin | 10011010000110111… |
… | …011000100001111111 |
3 | 1222101111200112101210 |
4 | 103100313120201333 |
5 | 314330104023021 |
6 | 13300242535503 |
7 | 1331366340300 |
oct | 232067304177 |
9 | 58344615353 |
10 | 20684048511 |
11 | 8854673875 |
12 | 4013067593 |
13 | 1c48320579 |
14 | 10030aa7a7 |
15 | 810d3be76 |
hex | 4d0dd887f |
20684048511 has 48 divisors (see below), whose sum is σ = 33503480064. Its totient is φ = 11296365696.
The previous prime is 20684048507. The next prime is 20684048531. The reversal of 20684048511 is 11584048602.
It is not a de Polignac number, because 20684048511 - 22 = 20684048507 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20684048511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20684048531) 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 47 ways as a sum of consecutive naturals, for example, 7446955 + ... + 7449731.
It is an arithmetic number, because the mean of its divisors is an integer number (697989168).
Almost surely, 220684048511 is an apocalyptic number.
20684048511 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20684048511 is a deficient number, since it is larger than the sum of its proper divisors (12819431553).
20684048511 is a wasteful number, since it uses less digits than its factorization.
20684048511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5020 (or 5013 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 39.
Subtracting from 20684048511 its reverse (11584048602), we obtain a palindrome (9099999909).
The spelling of 20684048511 in words is "twenty billion, six hundred eighty-four million, forty-eight thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •