Base | Representation |
---|---|
bin | 111101001010011110101… |
… | …111101101110110110011 |
3 | 112212211001010221012010201 |
4 | 331022132233231312303 |
5 | 1022331013134333321 |
6 | 12534521345340031 |
7 | 612444521526544 |
oct | 75123657556663 |
9 | 15784033835121 |
10 | 4203141324211 |
11 | 13805a677a185 |
12 | 57a71b637617 |
13 | 24647bb8111b |
14 | 10760c6d44cb |
15 | 745000dc291 |
hex | 3d29ebeddb3 |
4203141324211 has 16 divisors (see below), whose sum is σ = 4373821960704. Its totient is φ = 4035855432544.
The previous prime is 4203141324191. The next prime is 4203141324223. The reversal of 4203141324211 is 1124231413024.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 4203141324211 - 221 = 4203139227059 is a prime.
It is a super-2 number, since 2×42031413242112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4203141324211.
It is not an unprimeable number, because it can be changed into a prime (4203141324281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53135856 + ... + 53214898.
It is an arithmetic number, because the mean of its divisors is an integer number (273363872544).
Almost surely, 24203141324211 is an apocalyptic number.
4203141324211 is a deficient number, since it is larger than the sum of its proper divisors (170680636493).
4203141324211 is a wasteful number, since it uses less digits than its factorization.
4203141324211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100490.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 4203141324211 its reverse (1124231413024), we get a palindrome (5327372737235).
The spelling of 4203141324211 in words is "four trillion, two hundred three billion, one hundred forty-one million, three hundred twenty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •