Base | Representation |
---|---|
bin | 110000001111000101110110… |
… | …110001000011010000011001 |
3 | 1000211010200222011221022102122 |
4 | 300033011312301003100121 |
5 | 210301224000412034314 |
6 | 2031105143041511025 |
7 | 62453564020162115 |
oct | 6017056661032031 |
9 | 1024120864838378 |
10 | 212143312221209 |
11 | 61660523203096 |
12 | 1b962966042475 |
13 | 914b04a811655 |
14 | 3a55b10aac745 |
15 | 197d50389a28e |
hex | c0f176c43419 |
212143312221209 has 8 divisors (see below), whose sum is σ = 212616619417800. Its totient is φ = 211670008704000.
The previous prime is 212143312221187. The next prime is 212143312221223. The reversal of 212143312221209 is 902122213341212.
It can be written as a sum of positive squares in 4 ways, for example, as 80044425030025 + 132098887191184 = 8946755^2 + 11493428^2 .
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 212143312221209 - 228 = 212143043785753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212143312221509) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137841479 + ... + 139372019.
It is an arithmetic number, because the mean of its divisors is an integer number (26577077427225).
Almost surely, 2212143312221209 is an apocalyptic number.
It is an amenable number.
212143312221209 is a deficient number, since it is larger than the sum of its proper divisors (473307196591).
212143312221209 is a wasteful number, since it uses less digits than its factorization.
212143312221209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1839691.
The product of its (nonzero) digits is 20736, while the sum is 35.
The spelling of 212143312221209 in words is "two hundred twelve trillion, one hundred forty-three billion, three hundred twelve million, two hundred twenty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •