Base | Representation |
---|---|
bin | 101101011111000000101111… |
… | …111001100100101100000101 |
3 | 222020021221110120210202201011 |
4 | 231133000233321210230011 |
5 | 202210001433300301013 |
6 | 1545242324432002221 |
7 | 60064433663543116 |
oct | 5537005771445405 |
9 | 866257416722634 |
10 | 200043200400133 |
11 | 58815932568382 |
12 | 1a529867090371 |
13 | 8780cba3c011c |
14 | 37581dd28220d |
15 | 181d8b1a02c3d |
hex | b5f02fe64b05 |
200043200400133 has 8 divisors (see below), whose sum is σ = 200250719229600. Its totient is φ = 199835701381008.
The previous prime is 200043200400053. The next prime is 200043200400149. The reversal of 200043200400133 is 331004002340002.
It is a happy number.
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 200043200400133 - 29 = 200043200399621 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 (200043200403133) 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, 15296638 + ... + 25180816.
It is an arithmetic number, because the mean of its divisors is an integer number (25031339903700).
Almost surely, 2200043200400133 is an apocalyptic number.
It is an amenable number.
200043200400133 is a deficient number, since it is larger than the sum of its proper divisors (207518829467).
200043200400133 is a wasteful number, since it uses less digits than its factorization.
200043200400133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9905171.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 200043200400133 its reverse (331004002340002), we get a palindrome (531047202740135).
The spelling of 200043200400133 in words is "two hundred trillion, forty-three billion, two hundred million, four hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •