Base | Representation |
---|---|
bin | 101101011110100001110101… |
… | …101010110100101000001101 |
3 | 222020011202210120110201020002 |
4 | 231132201311222310220031 |
5 | 202203431000331400023 |
6 | 1545215155232134045 |
7 | 60062150350154540 |
oct | 5536416552645015 |
9 | 866152716421202 |
10 | 200010011200013 |
11 | 58802851088073 |
12 | 1a523344097325 |
13 | 877ab2b39b181 |
14 | 3756771460857 |
15 | 181cabce10b28 |
hex | b5e875ab4a0d |
200010011200013 has 8 divisors (see below), whose sum is σ = 229493558669760. Its totient is φ = 170754135912000.
The previous prime is 200010011200001. The next prime is 200010011200019. The reversal of 200010011200013 is 310002110010002.
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 200010011200013 - 24 = 200010011199997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200010011199967 and 200010011200003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200010011200019) 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, 56918043548 + ... + 56918047061.
It is an arithmetic number, because the mean of its divisors is an integer number (28686694833720).
Almost surely, 2200010011200013 is an apocalyptic number.
It is an amenable number.
200010011200013 is a deficient number, since it is larger than the sum of its proper divisors (29483547469747).
200010011200013 is a wasteful number, since it uses less digits than its factorization.
200010011200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113836090867.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 200010011200013 its reverse (310002110010002), we get a palindrome (510012121210015).
The spelling of 200010011200013 in words is "two hundred trillion, ten billion, eleven million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •