Base | Representation |
---|---|
bin | 111110001001110… |
… | …1101100100011001 |
3 | 12101100022112000120 |
4 | 1330103231210121 |
5 | 13232344322134 |
6 | 542540223453 |
7 | 102452546604 |
oct | 17423554431 |
9 | 5340275016 |
10 | 2085542169 |
11 | 980263777 |
12 | 4a253ab89 |
13 | 2730c8229 |
14 | 15ada533b |
15 | c315d649 |
hex | 7c4ed919 |
2085542169 has 8 divisors (see below), whose sum is σ = 2781991680. Its totient is φ = 1389727056.
The previous prime is 2085542119. The next prime is 2085542317. The reversal of 2085542169 is 9612455802.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2085542169 - 212 = 2085538073 is a prime.
It is a super-2 number, since 2×20855421692 = 8698972277354449122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2085542169.
It is not an unprimeable number, because it can be changed into a prime (2085542119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 150874 + ... + 164115.
It is an arithmetic number, because the mean of its divisors is an integer number (347748960).
Almost surely, 22085542169 is an apocalyptic number.
It is an amenable number.
2085542169 is a deficient number, since it is larger than the sum of its proper divisors (696449511).
2085542169 is a wasteful number, since it uses less digits than its factorization.
2085542169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317199.
The product of its (nonzero) digits is 172800, while the sum is 42.
The square root of 2085542169 is about 45667.7366310177. The cubic root of 2085542169 is about 1277.6336016564.
The spelling of 2085542169 in words is "two billion, eighty-five million, five hundred forty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •