Base | Representation |
---|---|
bin | 101111010110010011010000… |
… | …101001100111001000000000 |
3 | 1000022022121122002000201100110 |
4 | 233112103100221213020000 |
5 | 204243303420401321402 |
6 | 2014520242105351320 |
7 | 61601615355533253 |
oct | 5726232051471000 |
9 | 1008277562021313 |
10 | 208240694948352 |
11 | 60396423524800 |
12 | 1b432537498540 |
13 | 8c270232156b1 |
14 | 395cc90d7309a |
15 | 1911c41e8656c |
hex | bd64d0a67200 |
208240694948352 has 1920 divisors, whose sum is σ = 680156999165952. Its totient is φ = 56382703534080.
The previous prime is 208240694948291. The next prime is 208240694948387. The reversal of 208240694948352 is 253849496042802.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 455668916508 + ... + 455668916964.
Almost surely, 2208240694948352 is an apocalyptic number.
208240694948352 is a gapful number since it is divisible by the number (22) 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 208240694948352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (340078499582976).
208240694948352 is an abundant number, since it is smaller than the sum of its proper divisors (471916304217600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208240694948352 is a wasteful number, since it uses less digits than its factorization.
208240694948352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 670 (or 643 counting only the distinct ones).
The product of its (nonzero) digits is 238878720, while the sum is 66.
The spelling of 208240694948352 in words is "two hundred eight trillion, two hundred forty billion, six hundred ninety-four million, nine hundred forty-eight thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •