Base | Representation |
---|---|
bin | 10010110100110111… |
… | …011110010100111000 |
3 | 1221011202210100120120 |
4 | 102310313132110320 |
5 | 312344330411300 |
6 | 13141502453240 |
7 | 1313633541660 |
oct | 226467362470 |
9 | 57152710516 |
10 | 20214310200 |
11 | 86334a6497 |
12 | 3b01894220 |
13 | 1ba1c025c6 |
14 | d9a9511a0 |
15 | 7d49a03a0 |
hex | 4b4dde538 |
20214310200 has 96 divisors (see below), whose sum is σ = 71616428160. Its totient is φ = 4620412800.
The previous prime is 20214310189. The next prime is 20214310231. The reversal of 20214310200 is 201341202.
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 20214310200.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2402266 + ... + 2410665.
It is an arithmetic number, because the mean of its divisors is an integer number (746004460).
Almost surely, 220214310200 is an apocalyptic number.
20214310200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20214310200 is an abundant number, since it is smaller than the sum of its proper divisors (51402117960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20214310200 is a wasteful number, since it uses less digits than its factorization.
20214310200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4812957 (or 4812948 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 20214310200 its reverse (201341202), we get a palindrome (20415651402).
The spelling of 20214310200 in words is "twenty billion, two hundred fourteen million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •