Base | Representation |
---|---|
bin | 1011101110010010000… |
… | …0100000111011010111 |
3 | 201020212001211001200100 |
4 | 2323210200200323113 |
5 | 11244432432134333 |
6 | 232304540345143 |
7 | 20356635442425 |
oct | 2734440407327 |
9 | 636761731610 |
10 | 201402224343 |
11 | 7846133a0a1 |
12 | 330492451b3 |
13 | 15cb8999218 |
14 | 9a68412115 |
15 | 538b608213 |
hex | 2ee4820ed7 |
201402224343 has 12 divisors (see below), whose sum is σ = 291080299120. Its totient is φ = 134191545696.
The previous prime is 201402224341. The next prime is 201402224347. The reversal of 201402224343 is 343422204102.
201402224343 is a `hidden beast` number, since 2 + 0 + 1 + 4 + 0 + 222 + 434 + 3 = 666.
201402224343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201402224343 - 21 = 201402224341 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201402224341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6367003 + ... + 6398556.
Almost surely, 2201402224343 is an apocalyptic number.
201402224343 is a deficient number, since it is larger than the sum of its proper divisors (89678074777).
201402224343 is a wasteful number, since it uses less digits than its factorization.
201402224343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12767318 (or 12767315 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
Adding to 201402224343 its reverse (343422204102), we get a palindrome (544824428445).
The spelling of 201402224343 in words is "two hundred one billion, four hundred two million, two hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •