Base | Representation |
---|---|
bin | 10011000101111110… |
… | …101000111001110000 |
3 | 1221220210000002101120 |
4 | 103011332220321300 |
5 | 313441324314300 |
6 | 13230200102240 |
7 | 1324021014660 |
oct | 230576507160 |
9 | 57823002346 |
10 | 20501401200 |
11 | 8770563185 |
12 | 3b81a64980 |
13 | 1c19530737 |
14 | dc6b241a0 |
15 | 7eecae3a0 |
hex | 4c5fa8e70 |
20501401200 has 120 divisors (see below), whose sum is σ = 75054684288. Its totient is φ = 4686032640.
The previous prime is 20501401199. The next prime is 20501401211. The reversal of 20501401200 is 210410502.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×205014012002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 20501401200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1211922 + ... + 1228721.
Almost surely, 220501401200 is an apocalyptic number.
20501401200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20501401200 is an abundant number, since it is smaller than the sum of its proper divisors (54553283088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20501401200 is a wasteful number, since it uses less digits than its factorization.
20501401200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2440671 (or 2440660 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 20501401200 its reverse (210410502), we get a palindrome (20711811702).
The spelling of 20501401200 in words is "twenty billion, five hundred one million, four hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •