Base | Representation |
---|---|
bin | 1100010110000000010… |
… | …0000101100101000101 |
3 | 202021101011212100010001 |
4 | 3011200010011211011 |
5 | 11433302130103134 |
6 | 241231002401301 |
7 | 21215112311140 |
oct | 3054004054505 |
9 | 667334770101 |
10 | 212065081669 |
11 | 81a33234681 |
12 | 35124200231 |
13 | 16cc7abc95c |
14 | a39a601057 |
15 | 57b279d414 |
hex | 3160105945 |
212065081669 has 4 divisors (see below), whose sum is σ = 242360093344. Its totient is φ = 181770069996.
The previous prime is 212065081663. The next prime is 212065081681. The reversal of 212065081669 is 966180560212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212065081669 - 211 = 212065079621 is a prime.
It is a super-2 number, since 2×2120650816692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212065081663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15147505827 + ... + 15147505840.
It is an arithmetic number, because the mean of its divisors is an integer number (60590023336).
Almost surely, 2212065081669 is an apocalyptic number.
It is an amenable number.
212065081669 is a deficient number, since it is larger than the sum of its proper divisors (30295011675).
212065081669 is an equidigital number, since it uses as much as digits as its factorization.
212065081669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30295011674.
The product of its (nonzero) digits is 311040, while the sum is 46.
The spelling of 212065081669 in words is "two hundred twelve billion, sixty-five million, eighty-one thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •