Base | Representation |
---|---|
bin | 1100001010010110011… |
… | …1100011101101101000 |
3 | 201222022011220101122110 |
4 | 3002211213203231220 |
5 | 11410400340300434 |
6 | 235552341522320 |
7 | 21044440354245 |
oct | 3024547435550 |
9 | 658264811573 |
10 | 208937040744 |
11 | 80678570193 |
12 | 345b07133a0 |
13 | 16919a27573 |
14 | a180dc85cc |
15 | 567cd664e9 |
hex | 30a59e3b68 |
208937040744 has 64 divisors (see below), whose sum is σ = 546467523840. Its totient is φ = 66501309440.
The previous prime is 208937040733. The next prime is 208937040751. The reversal of 208937040744 is 447040739802.
208937040744 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 208937040693 and 208937040702.
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 15 ways as a sum of consecutive naturals, for example, 2212629 + ... + 2305124.
It is an arithmetic number, because the mean of its divisors is an integer number (8538555060).
Almost surely, 2208937040744 is an apocalyptic number.
208937040744 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
208937040744 is an abundant number, since it is smaller than the sum of its proper divisors (337530483096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208937040744 is a wasteful number, since it uses less digits than its factorization.
208937040744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4517850 (or 4517846 counting only the distinct ones).
The product of its (nonzero) digits is 1354752, while the sum is 48.
The spelling of 208937040744 in words is "two hundred eight billion, nine hundred thirty-seven million, forty thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •