Base | Representation |
---|---|
bin | 101101110001111001011011… |
… | …011101010001011010011011 |
3 | 222101220000100020222111220021 |
4 | 231301321123131101122123 |
5 | 202342232342343131133 |
6 | 1552114441135411311 |
7 | 60260256645312364 |
oct | 5561713335213233 |
9 | 871800306874807 |
10 | 201341011302043 |
11 | 59176274a26798 |
12 | 1a6b92a1383b37 |
13 | 88464b6b02142 |
14 | 37a0d57bcab6b |
15 | 184251d66152d |
hex | b71e5b75169b |
201341011302043 has 4 divisors (see below), whose sum is σ = 201346508103840. Its totient is φ = 201335514500248.
The previous prime is 201341011301999. The next prime is 201341011302071. The reversal of 201341011302043 is 340203110143102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201341011302043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201341011301999 and 201341011302017.
It is not an unprimeable number, because it can be changed into a prime (201341011308043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2748345955 + ... + 2748419212.
It is an arithmetic number, because the mean of its divisors is an integer number (50336627025960).
Almost surely, 2201341011302043 is an apocalyptic number.
201341011302043 is a deficient number, since it is larger than the sum of its proper divisors (5496801797).
201341011302043 is an equidigital number, since it uses as much as digits as its factorization.
201341011302043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5496801796.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 201341011302043 its reverse (340203110143102), we get a palindrome (541544121445145).
The spelling of 201341011302043 in words is "two hundred one trillion, three hundred forty-one billion, eleven million, three hundred two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •