Base | Representation |
---|---|
bin | 100000000001111110010… |
… | …111110101110001011111 |
3 | 21210102112110201000111022 |
4 | 200001332113311301133 |
5 | 242030420204344320 |
6 | 4403105154514355 |
7 | 315012246325616 |
oct | 40017627656137 |
9 | 7712473630438 |
10 | 2201143434335 |
11 | 7795550a313a |
12 | 2b671a5959bb |
13 | 12c74a730cc1 |
14 | 7877077887d |
15 | 3c3cba17325 |
hex | 2007e5f5c5f |
2201143434335 has 16 divisors (see below), whose sum is σ = 2691790462944. Its totient is φ = 1727316868992.
The previous prime is 2201143434289. The next prime is 2201143434337. The reversal of 2201143434335 is 5334343411022.
It is a cyclic number.
It is not a de Polignac number, because 2201143434335 - 226 = 2201076325471 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201143434295 and 2201143434304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201143434337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 335909 + ... + 2124881.
It is an arithmetic number, because the mean of its divisors is an integer number (168236903934).
Almost surely, 22201143434335 is an apocalyptic number.
2201143434335 is a deficient number, since it is larger than the sum of its proper divisors (490647028609).
2201143434335 is a wasteful number, since it uses less digits than its factorization.
2201143434335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1793674.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 2201143434335 its reverse (5334343411022), we get a palindrome (7535486845357).
The spelling of 2201143434335 in words is "two trillion, two hundred one billion, one hundred forty-three million, four hundred thirty-four thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •