Base | Representation |
---|---|
bin | 1100010011100110100… |
… | …0000111010000011101 |
3 | 202012201020102200101110 |
4 | 3010321220013100131 |
5 | 11430442033324201 |
6 | 241043004532233 |
7 | 21163122112302 |
oct | 3047150072035 |
9 | 665636380343 |
10 | 211420214301 |
11 | 8173222123a |
12 | 34b84251079 |
13 | 16c24314c2a |
14 | a338ad90a9 |
15 | 5775d6b6d6 |
hex | 3139a0741d |
211420214301 has 8 divisors (see below), whose sum is σ = 282091722880. Its totient is φ = 140847757632.
The previous prime is 211420214297. The next prime is 211420214309. The reversal of 211420214301 is 103412024112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211420214301 - 22 = 211420214297 is a prime.
It is a super-3 number, since 3×2114202143013 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211420214309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24757996 + ... + 24766533.
It is an arithmetic number, because the mean of its divisors is an integer number (35261465360).
Almost surely, 2211420214301 is an apocalyptic number.
It is an amenable number.
211420214301 is a deficient number, since it is larger than the sum of its proper divisors (70671508579).
211420214301 is a wasteful number, since it uses less digits than its factorization.
211420214301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49525955.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 211420214301 its reverse (103412024112), we get a palindrome (314832238413).
The spelling of 211420214301 in words is "two hundred eleven billion, four hundred twenty million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •