Base | Representation |
---|---|
bin | 1100001000100111011… |
… | …1100111100010100011 |
3 | 201221002201212220021020 |
4 | 3002021313213202203 |
5 | 11403422200114200 |
6 | 235434231300523 |
7 | 21030055262502 |
oct | 3021167474243 |
9 | 657081786236 |
10 | 208471488675 |
11 | 804597a200a |
12 | 344a081a743 |
13 | 16874443b78 |
14 | a13923c839 |
15 | 5652054ea0 |
hex | 3089de78a3 |
208471488675 has 24 divisors (see below), whose sum is σ = 346218507264. Its totient is φ = 110686198560.
The previous prime is 208471488671. The next prime is 208471488769. The reversal of 208471488675 is 576884174802.
208471488675 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 208471488675 - 22 = 208471488671 is a prime.
It is not an unprimeable number, because it can be changed into a prime (208471488671) by changing a digit.
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, 6215607 + ... + 6249056.
It is an arithmetic number, because the mean of its divisors is an integer number (14425771136).
Almost surely, 2208471488675 is an apocalyptic number.
208471488675 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
208471488675 is a deficient number, since it is larger than the sum of its proper divisors (137747018589).
208471488675 is a wasteful number, since it uses less digits than its factorization.
208471488675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12464899 (or 12464894 counting only the distinct ones).
The product of its (nonzero) digits is 24084480, while the sum is 60.
The spelling of 208471488675 in words is "two hundred eight billion, four hundred seventy-one million, four hundred eighty-eight thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •