Base | Representation |
---|---|
bin | 101101100001010101000001… |
… | …110010000001011000010101 |
3 | 222020212011102110122211100021 |
4 | 231201111001302001120111 |
5 | 202220104021013402331 |
6 | 1545443415220145141 |
7 | 60112101312530500 |
oct | 5541250162013025 |
9 | 866764373584307 |
10 | 200202414200341 |
11 | 58877404605a43 |
12 | 1a55469b5381b1 |
13 | 87930117c9367 |
14 | 3761bc45c0137 |
15 | 1822ace442211 |
hex | b61541c81615 |
200202414200341 has 24 divisors (see below), whose sum is σ = 246077926966080. Its totient is φ = 161952242925312.
The previous prime is 200202414200251. The next prime is 200202414200413. The reversal of 200202414200341 is 143002414202002.
It is not a de Polignac number, because 200202414200341 - 27 = 200202414200213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200202414200641) 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 23 ways as a sum of consecutive naturals, for example, 408576796 + ... + 409066501.
It is an arithmetic number, because the mean of its divisors is an integer number (10253246956920).
Almost surely, 2200202414200341 is an apocalyptic number.
It is an amenable number.
200202414200341 is a deficient number, since it is larger than the sum of its proper divisors (45875512765739).
200202414200341 is a wasteful number, since it uses less digits than its factorization.
200202414200341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817643593 (or 817643586 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 200202414200341 its reverse (143002414202002), we get a palindrome (343204828402343).
The spelling of 200202414200341 in words is "two hundred trillion, two hundred two billion, four hundred fourteen million, two hundred thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •