Base | Representation |
---|---|
bin | 1100000111001100100… |
… | …1011111001101111100 |
3 | 201220010011121100212220 |
4 | 3001303021133031330 |
5 | 11402132104002322 |
6 | 235332333125340 |
7 | 21014446225230 |
oct | 3016311371574 |
9 | 656104540786 |
10 | 208090297212 |
11 | 80283603246 |
12 | 343b5029850 |
13 | 168134895a5 |
14 | a1007725c0 |
15 | 562d85955c |
hex | 307325f37c |
208090297212 has 96 divisors (see below), whose sum is σ = 561753787392. Its totient is φ = 58723301376.
The previous prime is 208090297171. The next prime is 208090297243. The reversal of 208090297212 is 212792090802.
208090297212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4073058 + ... + 4123830.
It is an arithmetic number, because the mean of its divisors is an integer number (5851601952).
Almost surely, 2208090297212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 208090297212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (280876893696).
208090297212 is an abundant number, since it is smaller than the sum of its proper divisors (353663490180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208090297212 is a wasteful number, since it uses less digits than its factorization.
208090297212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51387 (or 51385 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 42.
The spelling of 208090297212 in words is "two hundred eight billion, ninety million, two hundred ninety-seven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •