Base | Representation |
---|---|
bin | 1100011000100010101… |
… | …0100111011100101011 |
3 | 202100010122122022112021 |
4 | 3012020222213130223 |
5 | 11441201021124012 |
6 | 241422334525311 |
7 | 21241023314341 |
oct | 3061052473453 |
9 | 670118568467 |
10 | 212746270507 |
11 | 822527a5961 |
12 | 35294366837 |
13 | 170a5c73a84 |
14 | a422c7d991 |
15 | 58024a7007 |
hex | 3188aa772b |
212746270507 has 8 divisors (see below), whose sum is σ = 217955171952. Its totient is φ = 207538320000.
The previous prime is 212746270493. The next prime is 212746270543. The reversal of 212746270507 is 705072647212.
212746270507 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 212746270507 - 231 = 210598786859 is a prime.
It is a super-2 number, since 2×2127462705072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212726270507) 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, 226132 + ... + 690382.
It is an arithmetic number, because the mean of its divisors is an integer number (27244396494).
Almost surely, 2212746270507 is an apocalyptic number.
212746270507 is a deficient number, since it is larger than the sum of its proper divisors (5208901445).
212746270507 is a wasteful number, since it uses less digits than its factorization.
212746270507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475469.
The product of its (nonzero) digits is 329280, while the sum is 43.
The spelling of 212746270507 in words is "two hundred twelve billion, seven hundred forty-six million, two hundred seventy thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.389 sec. • engine limits •