Base | Representation |
---|---|
bin | 10010110111000100… |
… | …011101000110101100 |
3 | 1221021100022222110110 |
4 | 102313010131012230 |
5 | 312433311030000 |
6 | 13145302540020 |
7 | 1314562635132 |
oct | 226704350654 |
9 | 57240288413 |
10 | 20251267500 |
11 | 8652349012 |
12 | 3b12137610 |
13 | 1ba9772229 |
14 | da1811752 |
15 | 7d7d50850 |
hex | 4b711d1ac |
20251267500 has 60 divisors (see below), whose sum is σ = 59047317560. Its totient is φ = 5400336000.
The previous prime is 20251267489. The next prime is 20251267507. The reversal of 20251267500 is 576215202.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×202512675002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20251267507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1342585 + ... + 1357584.
Almost surely, 220251267500 is an apocalyptic number.
20251267500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20251267500 is an abundant number, since it is smaller than the sum of its proper divisors (38796050060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20251267500 is a wasteful number, since it uses less digits than its factorization.
20251267500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2700196 (or 2700179 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 30.
The spelling of 20251267500 in words is "twenty billion, two hundred fifty-one million, two hundred sixty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •