Base | Representation |
---|---|
bin | 101101011110101101111101… |
… | …101101111000110110000101 |
3 | 222020020000101221202100100022 |
4 | 231132231331231320312011 |
5 | 202204134131431421313 |
6 | 1545225151214224525 |
7 | 60063121114531625 |
oct | 5536557555706605 |
9 | 866200357670308 |
10 | 200023031123333 |
11 | 58808322530180 |
12 | 1a5259784b5145 |
13 | 877c124927402 |
14 | 37572486d4885 |
15 | 181d0d0e9ac08 |
hex | b5eb7db78d85 |
200023031123333 has 8 divisors (see below), whose sum is σ = 220969056247680. Its totient is φ = 179537358199680.
The previous prime is 200023031123327. The next prime is 200023031123347. The reversal of 200023031123333 is 333321130320002.
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 200023031123333 - 222 = 200023026929029 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 (200023031123033) 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, 115088049260 + ... + 115088050997.
It is an arithmetic number, because the mean of its divisors is an integer number (27621132030960).
Almost surely, 2200023031123333 is an apocalyptic number.
It is an amenable number.
200023031123333 is a deficient number, since it is larger than the sum of its proper divisors (20946025124347).
200023031123333 is a wasteful number, since it uses less digits than its factorization.
200023031123333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230176100347.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 200023031123333 its reverse (333321130320002), we get a palindrome (533344161443335).
The spelling of 200023031123333 in words is "two hundred trillion, twenty-three billion, thirty-one million, one hundred twenty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •