Base | Representation |
---|---|
bin | 1100011000001111000… |
… | …1001011110101100011 |
3 | 202022220221000221110221 |
4 | 3012003301023311203 |
5 | 11441014002400324 |
6 | 241410241503511 |
7 | 21236005035556 |
oct | 3060361136543 |
9 | 668827027427 |
10 | 212664106339 |
11 | 82210386793 |
12 | 35270941b97 |
13 | 17091c36619 |
14 | a415db269d |
15 | 57ea1770e4 |
hex | 3183c4bd63 |
212664106339 has 8 divisors (see below), whose sum is σ = 223530158880. Its totient is φ = 201933036096.
The previous prime is 212664106309. The next prime is 212664106373. The reversal of 212664106339 is 933601466212.
212664106339 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212664106339 - 213 = 212664098147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212664106295 and 212664106304.
It is not an unprimeable number, because it can be changed into a prime (212664106309) 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 7 ways as a sum of consecutive naturals, for example, 33742344 + ... + 33748645.
It is an arithmetic number, because the mean of its divisors is an integer number (27941269860).
Almost surely, 2212664106339 is an apocalyptic number.
212664106339 is a deficient number, since it is larger than the sum of its proper divisors (10866052541).
212664106339 is a wasteful number, since it uses less digits than its factorization.
212664106339 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67491149.
The product of its (nonzero) digits is 279936, while the sum is 43.
The spelling of 212664106339 in words is "two hundred twelve billion, six hundred sixty-four million, one hundred six thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •