Base | Representation |
---|---|
bin | 11111000001001111001000… |
… | …11101110001001010101001 |
3 | 22221112000122002202121021022 |
4 | 33200213210131301022221 |
5 | 32420042100402332320 |
6 | 401024131150022225 |
7 | 20240112055543436 |
oct | 1740474435611251 |
9 | 287460562677238 |
10 | 68212208636585 |
11 | 1a8096a9539942 |
12 | 7797b967a7975 |
13 | 2c0a4cac15720 |
14 | 12bb6ba6a4b8d |
15 | 7d4551bc1325 |
hex | 3e09e47712a9 |
68212208636585 has 32 divisors (see below), whose sum is σ = 89247436951680. Its totient is φ = 49746115150848.
The previous prime is 68212208636471. The next prime is 68212208636599. The reversal of 68212208636585 is 58563680221286.
68212208636585 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 68212208636585 - 210 = 68212208635561 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11652482 + ... + 16498628.
It is an arithmetic number, because the mean of its divisors is an integer number (2788982404740).
Almost surely, 268212208636585 is an apocalyptic number.
68212208636585 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
68212208636585 is a deficient number, since it is larger than the sum of its proper divisors (21035228315095).
68212208636585 is a wasteful number, since it uses less digits than its factorization.
68212208636585 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4848857.
The product of its (nonzero) digits is 66355200, while the sum is 62.
The spelling of 68212208636585 in words is "sixty-eight trillion, two hundred twelve billion, two hundred eight million, six hundred thirty-six thousand, five hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •