Base | Representation |
---|---|
bin | 11110000110001000000… |
… | …010010001110111010001 |
3 | 21022201021201212021112100 |
4 | 132012020002101313101 |
5 | 232341043330140314 |
6 | 4222033355551013 |
7 | 302263654163202 |
oct | 36061002216721 |
9 | 7281251767470 |
10 | 2068161568209 |
11 | 728114319940 |
12 | 2949a715b469 |
13 | 120046b53b59 |
14 | 721572675a9 |
15 | 38be6ee2c09 |
hex | 1e188091dd1 |
2068161568209 has 72 divisors (see below), whose sum is σ = 3432735214272. Its totient is φ = 1187714278080.
The previous prime is 2068161568199. The next prime is 2068161568241. The reversal of 2068161568209 is 9028651618602.
2068161568209 is a `hidden beast` number, since 2 + 0 + 68 + 16 + 1 + 568 + 2 + 0 + 9 = 666.
It is not a de Polignac number, because 2068161568209 - 29 = 2068161567697 is a prime.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (2068161568409) 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 71 ways as a sum of consecutive naturals, for example, 26029707 + ... + 26109039.
It is an arithmetic number, because the mean of its divisors is an integer number (47676877976).
Almost surely, 22068161568209 is an apocalyptic number.
It is an amenable number.
2068161568209 is a deficient number, since it is larger than the sum of its proper divisors (1364573646063).
2068161568209 is a wasteful number, since it uses less digits than its factorization.
2068161568209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79587 (or 79477 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 54.
The spelling of 2068161568209 in words is "two trillion, sixty-eight billion, one hundred sixty-one million, five hundred sixty-eight thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •