Base | Representation |
---|---|

bin | 1100010101110000110… |

… | …0001111011010001110 |

3 | 202021012122121110001011 |

4 | 3011130030033122032 |

5 | 11433134012011342 |

6 | 241220322035434 |

7 | 21213363130045 |

oct | 3053414173216 |

9 | 667178543034 |

10 | 212000110222 |

11 | 819aa59866a |

12 | 351064a8b7a |

13 | 16cb74c1c04 |

14 | a391b2b55c |

15 | 57abc17717 |

hex | 315c30f68e |

212000110222 has 8 divisors (see below), whose sum is σ = 334737016200. Its totient is φ = 100421104824.

The previous prime is 212000110207. The next prime is 212000110237. The reversal of 212000110222 is 222011000212.

It is a happy number.

212000110222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an interprime number because it is at equal distance from previous prime (212000110207) and next prime (212000110237).

It is a sphenic number, since it is the product of 3 distinct primes.

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 2789475097 + ... + 2789475172.

It is an arithmetic number, because the mean of its divisors is an integer number (41842127025).

Almost surely, 2^{212000110222} is an apocalyptic number.

212000110222 is a deficient number, since it is larger than the sum of its proper divisors (122736905978).

212000110222 is a wasteful number, since it uses less digits than its factorization.

212000110222 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 5578950290.

The product of its (nonzero) digits is 32, while the sum is 13.

Adding to 212000110222 its reverse (222011000212), we get a palindrome (434011110434).

The spelling of 212000110222 in words is "two hundred twelve billion, one hundred ten thousand, two hundred twenty-two".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •