Base | Representation |
---|---|
bin | 1011101001111010110… |
… | …1000111000110101001 |
3 | 201010211110011212100100 |
4 | 2322132231013012221 |
5 | 11240033131340241 |
6 | 231552423500013 |
7 | 20315625310050 |
oct | 2723655070651 |
9 | 633743155310 |
10 | 200231121321 |
11 | 77a10280060 |
12 | 32980bb7609 |
13 | 15b6018195a |
14 | 9996a85397 |
15 | 531d8c99b6 |
hex | 2e9eb471a9 |
200231121321 has 192 divisors, whose sum is σ = 385482240000. Its totient is φ = 97082979840.
The previous prime is 200231121313. The next prime is 200231121347. The reversal of 200231121321 is 123121132002.
200231121321 is a `hidden beast` number, since 200 + 23 + 1 + 121 + 321 = 666.
It is not a de Polignac number, because 200231121321 - 23 = 200231121313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200231121294 and 200231121303.
It is not an unprimeable number, because it can be changed into a prime (200231121371) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 140119035 + ... + 140120463.
It is an arithmetic number, because the mean of its divisors is an integer number (2007720000).
Almost surely, 2200231121321 is an apocalyptic number.
200231121321 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
200231121321 is a deficient number, since it is larger than the sum of its proper divisors (185251118679).
200231121321 is a wasteful number, since it uses less digits than its factorization.
200231121321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1684 (or 1681 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 200231121321 its reverse (123121132002), we get a palindrome (323352253323).
The spelling of 200231121321 in words is "two hundred billion, two hundred thirty-one million, one hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •