Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1010111101111011101 |
3 | 201010112201011100222122 |
4 | 2322120011113233131 |
5 | 11234321212243123 |
6 | 231533414552325 |
7 | 20313106164026 |
oct | 2723005275735 |
9 | 633481140878 |
10 | 200120040413 |
11 | 77963600357 |
12 | 3294b9686a5 |
13 | 15b4315b5c7 |
14 | 998600bc4d |
15 | 5313c86bc8 |
hex | 2e98157bdd |
200120040413 has 8 divisors (see below), whose sum is σ = 200330205600. Its totient is φ = 199909979568.
The previous prime is 200120040349. The next prime is 200120040437. The reversal of 200120040413 is 314040021002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200120040413 - 26 = 200120040349 is a prime.
It is a super-3 number, since 3×2001200404133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200120040391 and 200120040400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200125040413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4156643 + ... + 4204511.
It is an arithmetic number, because the mean of its divisors is an integer number (25041275700).
Almost surely, 2200120040413 is an apocalyptic number.
It is an amenable number.
200120040413 is a deficient number, since it is larger than the sum of its proper divisors (210165187).
200120040413 is a wasteful number, since it uses less digits than its factorization.
200120040413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52171.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 200120040413 its reverse (314040021002), we get a palindrome (514160061415).
The spelling of 200120040413 in words is "two hundred billion, one hundred twenty million, forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •