Base | Representation |
---|---|
bin | 101111110001100001010100… |
… | …101100100110111001010000 |
3 | 1000112221102210020222121012221 |
4 | 233301201110230212321100 |
5 | 210014430240100200422 |
6 | 2022511432404430424 |
7 | 62154014633511163 |
oct | 5761412454467120 |
9 | 1015842706877187 |
10 | 210111221100112 |
11 | 60a477397a5022 |
12 | 1b694b669a8414 |
13 | 90315318b5837 |
14 | 39c561a199ada |
15 | 194571d3d23c7 |
hex | bf1854b26e50 |
210111221100112 has 80 divisors (see below), whose sum is σ = 415541675059200. Its totient is φ = 102896992373760.
The previous prime is 210111221100037. The next prime is 210111221100119. The reversal of 210111221100112 is 211001122111012.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210111221100119) 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 15 ways as a sum of consecutive naturals, for example, 248767162 + ... + 249610342.
It is an arithmetic number, because the mean of its divisors is an integer number (5194270938240).
Almost surely, 2210111221100112 is an apocalyptic number.
It is an amenable number.
210111221100112 is a deficient number, since it is larger than the sum of its proper divisors (205430453959088).
210111221100112 is a wasteful number, since it uses less digits than its factorization.
210111221100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844844 (or 844838 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 210111221100112 its reverse (211001122111012), we get a palindrome (421112343211124).
The spelling of 210111221100112 in words is "two hundred ten trillion, one hundred eleven billion, two hundred twenty-one million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •