Base | Representation |
---|---|
bin | 1100000111101000011… |
… | …0010000100100000000 |
3 | 201220102021222221212010 |
4 | 3001322012100210000 |
5 | 11402401431010024 |
6 | 235352100132520 |
7 | 21020363242461 |
oct | 3017206204400 |
9 | 656367887763 |
10 | 208206891264 |
11 | 803333a9069 |
12 | 34428097140 |
13 | 16831690158 |
14 | a112042d68 |
15 | 5638bdab29 |
hex | 307a190900 |
208206891264 has 144 divisors (see below), whose sum is σ = 589256845632. Its totient is φ = 65038516224.
The previous prime is 208206891257. The next prime is 208206891313. The reversal of 208206891264 is 462198602802.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3007827 + ... + 3076269.
It is an arithmetic number, because the mean of its divisors is an integer number (4092061428).
Almost surely, 2208206891264 is an apocalyptic number.
208206891264 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 208206891264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (294628422816).
208206891264 is an abundant number, since it is smaller than the sum of its proper divisors (381049954368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208206891264 is a wasteful number, since it uses less digits than its factorization.
208206891264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68712 (or 68698 counting only the distinct ones).
The product of its (nonzero) digits is 663552, while the sum is 48.
The spelling of 208206891264 in words is "two hundred eight billion, two hundred six million, eight hundred ninety-one thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •