Base | Representation |
---|---|
bin | 1011101101001110111… |
… | …1101110111101111111 |
3 | 201020010110122110020200 |
4 | 2323103233232331333 |
5 | 11243343434020333 |
6 | 232221013014543 |
7 | 20346652206333 |
oct | 2732357567577 |
9 | 636113573220 |
10 | 201121001343 |
11 | 78327620099 |
12 | 32b8b024453 |
13 | 15c72643c92 |
14 | 9a3cd297c3 |
15 | 5371aa7c13 |
hex | 2ed3beef7f |
201121001343 has 48 divisors (see below), whose sum is σ = 304244356416. Its totient is φ = 127908979200.
The previous prime is 201121001273. The next prime is 201121001351. The reversal of 201121001343 is 343100121102.
201121001343 is a `hidden beast` number, since 201 + 121 + 0 + 0 + 1 + 343 = 666.
It is not a de Polignac number, because 201121001343 - 28 = 201121001087 is a prime.
It is a super-2 number, since 2×2011210013432 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121001243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3435171 + ... + 3493227.
It is an arithmetic number, because the mean of its divisors is an integer number (6338424092).
Almost surely, 2201121001343 is an apocalyptic number.
201121001343 is a deficient number, since it is larger than the sum of its proper divisors (103123355073).
201121001343 is a wasteful number, since it uses less digits than its factorization.
201121001343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58304 (or 58301 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 201121001343 its reverse (343100121102), we get a palindrome (544221122445).
The spelling of 201121001343 in words is "two hundred one billion, one hundred twenty-one million, one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •