Base | Representation |
---|---|
bin | 110000001111000101101100… |
… | …101111011000010100100011 |
3 | 1000211010200112110102100110111 |
4 | 300033011230233120110203 |
5 | 210301223124331323133 |
6 | 2031105114232312151 |
7 | 62453556605336350 |
oct | 6017055457302443 |
9 | 1024120473370414 |
10 | 212143144011043 |
11 | 61660447263323 |
12 | 1b962919842657 |
13 | 914b021a07bcb |
14 | 3a55ad6603627 |
15 | 197d4e3c201cd |
hex | c0f16cbd8523 |
212143144011043 has 64 divisors (see below), whose sum is σ = 253170634752000. Its totient is φ = 173920777873920.
The previous prime is 212143144010957. The next prime is 212143144011089. The reversal of 212143144011043 is 340110441341212.
It is not a de Polignac number, because 212143144011043 - 245 = 176958771922211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212143144010996 and 212143144011014.
It is not an unprimeable number, because it can be changed into a prime (212143144011343) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 45108044430 + ... + 45108049132.
It is an arithmetic number, because the mean of its divisors is an integer number (3955791168000).
Almost surely, 2212143144011043 is an apocalyptic number.
212143144011043 is a deficient number, since it is larger than the sum of its proper divisors (41027490740957).
212143144011043 is a wasteful number, since it uses less digits than its factorization.
212143144011043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8572.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 212143144011043 its reverse (340110441341212), we get a palindrome (552253585352255).
The spelling of 212143144011043 in words is "two hundred twelve trillion, one hundred forty-three billion, one hundred forty-four million, eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •