Base | Representation |
---|---|
bin | 1100010011100110101… |
… | …1001010000011101011 |
3 | 202012201021221012220101 |
4 | 3010321223022003223 |
5 | 11430442234342303 |
6 | 241043034010231 |
7 | 21163131644452 |
oct | 3047153120353 |
9 | 665637835811 |
10 | 211421012203 |
11 | 81732716765 |
12 | 34b84576977 |
13 | 16c2453416b |
14 | a338c65b99 |
15 | 5775e77d1d |
hex | 3139aca0eb |
211421012203 has 4 divisors (see below), whose sum is σ = 211424688328. Its totient is φ = 211417336080.
The previous prime is 211421012197. The next prime is 211421012219. The reversal of 211421012203 is 302210124112.
211421012203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211421012203 - 29 = 211421011691 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211421012293) 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 3 ways as a sum of consecutive naturals, for example, 1750401 + ... + 1867282.
It is an arithmetic number, because the mean of its divisors is an integer number (52856172082).
Almost surely, 2211421012203 is an apocalyptic number.
211421012203 is a deficient number, since it is larger than the sum of its proper divisors (3676125).
211421012203 is an equidigital number, since it uses as much as digits as its factorization.
211421012203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3676124.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 211421012203 its reverse (302210124112), we get a palindrome (513631136315).
The spelling of 211421012203 in words is "two hundred eleven billion, four hundred twenty-one million, twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •