Base | Representation |
---|---|
bin | 1011101010001110000… |
… | …1110000001110111101 |
3 | 201011001002102110101022 |
4 | 2322203201300032331 |
5 | 11240214334431031 |
6 | 232004433553525 |
7 | 20320630106606 |
oct | 2724341601675 |
9 | 634032373338 |
10 | 200312030141 |
11 | 77a51a12053 |
12 | 329a41158a5 |
13 | 15b73b6c8b2 |
14 | 99a3706dad |
15 | 5325a5c97b |
hex | 2ea38703bd |
200312030141 has 4 divisors (see below), whose sum is σ = 200312960892. Its totient is φ = 200311099392.
The previous prime is 200312030069. The next prime is 200312030167. The reversal of 200312030141 is 141030213002.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 19440446041 + 180871584100 = 139429^2 + 425290^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200312030141 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 (200312038141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41405 + ... + 634301.
It is an arithmetic number, because the mean of its divisors is an integer number (50078240223).
Almost surely, 2200312030141 is an apocalyptic number.
It is an amenable number.
200312030141 is a deficient number, since it is larger than the sum of its proper divisors (930751).
200312030141 is an equidigital number, since it uses as much as digits as its factorization.
200312030141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 930750.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 200312030141 its reverse (141030213002), we get a palindrome (341342243143).
The spelling of 200312030141 in words is "two hundred billion, three hundred twelve million, thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •