Base | Representation |
---|---|
bin | 1100010010110100111… |
… | …0010000110101011011 |
3 | 202012011201211221121000 |
4 | 3010231032100311123 |
5 | 11430030300024240 |
6 | 241010212320043 |
7 | 21155014215561 |
oct | 3045516206533 |
9 | 665151757530 |
10 | 211212111195 |
11 | 816358042a8 |
12 | 34b26613023 |
13 | 16bc01815b7 |
14 | a319207a31 |
15 | 5762961430 |
hex | 312d390d5b |
211212111195 has 96 divisors (see below), whose sum is σ = 419869900800. Its totient is φ = 100439834112.
The previous prime is 211212111193. The next prime is 211212111199. The reversal of 211212111195 is 591111212112.
211212111195 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 211212111195 - 21 = 211212111193 is a prime.
It is a super-2 number, since 2×2112121111952 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (211212111193) 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 95 ways as a sum of consecutive naturals, for example, 598822 + ... + 883748.
It is an arithmetic number, because the mean of its divisors is an integer number (4373644800).
Almost surely, 2211212111195 is an apocalyptic number.
211212111195 is a deficient number, since it is larger than the sum of its proper divisors (208657789605).
211212111195 is a wasteful number, since it uses less digits than its factorization.
211212111195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284994 (or 284971 counting only the distinct ones).
The product of its digits is 360, while the sum is 27.
The spelling of 211212111195 in words is "two hundred eleven billion, two hundred twelve million, one hundred eleven thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •