Base | Representation |
---|---|
bin | 1011111001001111010… |
… | …0000100001101101101 |
3 | 201112110001002100121222 |
4 | 2332103310010031231 |
5 | 11321443400044123 |
6 | 233512443233125 |
7 | 20522550631121 |
oct | 2762364041555 |
9 | 645401070558 |
10 | 204343362413 |
11 | 79730556713 |
12 | 3372a2187a5 |
13 | 163671117c8 |
14 | 9c66c95581 |
15 | 54ae9216c8 |
hex | 2f93d0436d |
204343362413 has 4 divisors (see below), whose sum is σ = 216363560220. Its totient is φ = 192323164608.
The previous prime is 204343362341. The next prime is 204343362469. The reversal of 204343362413 is 314263343402.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 188020233769 + 16323128644 = 433613^2 + 127762^2 .
It is a cyclic number.
It is not a de Polignac number, because 204343362413 - 216 = 204343296877 is a prime.
It is a super-2 number, since 2×2043433624132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204343367413) 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, 6010098878 + ... + 6010098911.
It is an arithmetic number, because the mean of its divisors is an integer number (54090890055).
Almost surely, 2204343362413 is an apocalyptic number.
It is an amenable number.
204343362413 is a deficient number, since it is larger than the sum of its proper divisors (12020197807).
204343362413 is a wasteful number, since it uses less digits than its factorization.
204343362413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12020197806.
The product of its (nonzero) digits is 124416, while the sum is 35.
The spelling of 204343362413 in words is "two hundred four billion, three hundred forty-three million, three hundred sixty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •