Base | Representation |
---|---|
bin | 101101011110111000100101… |
… | …010001010100111101110101 |
3 | 222020021002211111210011110011 |
4 | 231132320211101110331311 |
5 | 202204331004112040341 |
6 | 1545234314405500221 |
7 | 60064003463564644 |
oct | 5536704521247565 |
9 | 866232744704404 |
10 | 200034432143221 |
11 | 58812143070165 |
12 | 1a52801a711671 |
13 | 878022095c620 |
14 | 3757a0a95335b |
15 | 181d54bd50b81 |
hex | b5ee25454f75 |
200034432143221 has 8 divisors (see below), whose sum is σ = 215421877972224. Its totient is φ = 184647012288240.
The previous prime is 200034432143179. The next prime is 200034432143233. The reversal of 200034432143221 is 122341234430002.
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 200034432143221 - 231 = 200032284659573 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 (200034432183221) 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, 11309316 + ... + 22977586.
It is an arithmetic number, because the mean of its divisors is an integer number (26927734746528).
Almost surely, 2200034432143221 is an apocalyptic number.
It is an amenable number.
200034432143221 is a deficient number, since it is larger than the sum of its proper divisors (15387445829003).
200034432143221 is a wasteful number, since it uses less digits than its factorization.
200034432143221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12987011.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 200034432143221 its reverse (122341234430002), we get a palindrome (322375666573223).
The spelling of 200034432143221 in words is "two hundred trillion, thirty-four billion, four hundred thirty-two million, one hundred forty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •