Base | Representation |
---|---|
bin | 101101011110110101100100… |
… | …110111111010000110111101 |
3 | 222020020210111112221102001202 |
4 | 231132311210313322012331 |
5 | 202204302401242113031 |
6 | 1545233022220545245 |
7 | 60063530500150421 |
oct | 5536654467720675 |
9 | 866223445842052 |
10 | 200031204254141 |
11 | 58810836aa9337 |
12 | 1a5274796b2225 |
13 | 877cb27ca78a0 |
14 | 37577c1d88b81 |
15 | 181d40d7942cb |
hex | b5ed64dfa1bd |
200031204254141 has 16 divisors (see below), whose sum is σ = 229626350419200. Its totient is φ = 172711819245888.
The previous prime is 200031204254111. The next prime is 200031204254209. The reversal of 200031204254141 is 141452402130002.
It is a happy number.
It is not a de Polignac number, because 200031204254141 - 210 = 200031204253117 is a prime.
It is a super-2 number, since 2×2000312042541412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200031204254111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5125568666 + ... + 5125607691.
It is an arithmetic number, because the mean of its divisors is an integer number (14351646901200).
Almost surely, 2200031204254141 is an apocalyptic number.
It is an amenable number.
200031204254141 is a deficient number, since it is larger than the sum of its proper divisors (29595146165059).
200031204254141 is a wasteful number, since it uses less digits than its factorization.
200031204254141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10251176468.
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 200031204254141 its reverse (141452402130002), we get a palindrome (341483606384143).
The spelling of 200031204254141 in words is "two hundred trillion, thirty-one billion, two hundred four million, two hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •