Base | Representation |
---|---|
bin | 11000101100000… |
… | …101110010000001 |
3 | 1001212102002221121 |
4 | 120230011302001 |
5 | 1322014224301 |
6 | 105033552241 |
7 | 13156510555 |
oct | 3054056201 |
9 | 1055362847 |
10 | 414211201 |
11 | 1a28a2008 |
12 | b6875681 |
13 | 67a78bb1 |
14 | 3d023865 |
15 | 2656e3a1 |
hex | 18b05c81 |
414211201 has 4 divisors (see below), whose sum is σ = 418312404. Its totient is φ = 410110000.
The previous prime is 414211129. The next prime is 414211207. The reversal of 414211201 is 102112414.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 358723600 + 55487601 = 18940^2 + 7449^2 .
It is a cyclic number.
It is not a de Polignac number, because 414211201 - 227 = 279993473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (414211207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2050450 + ... + 2050651.
It is an arithmetic number, because the mean of its divisors is an integer number (104578101).
Almost surely, 2414211201 is an apocalyptic number.
It is an amenable number.
414211201 is a deficient number, since it is larger than the sum of its proper divisors (4101203).
414211201 is a wasteful number, since it uses less digits than its factorization.
414211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4101202.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 414211201 is about 20352.1792690611. The cubic root of 414211201 is about 745.4307081101.
Adding to 414211201 its reverse (102112414), we get a palindrome (516323615).
The spelling of 414211201 in words is "four hundred fourteen million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •