Base | Representation |
---|---|
bin | 101101100010111100000001… |
… | …011000110100000100111001 |
3 | 222021020201212120222221011121 |
4 | 231202330001120310010321 |
5 | 202223412012232000441 |
6 | 1550010305002025241 |
7 | 60123064644031414 |
oct | 5542740130640471 |
9 | 867221776887147 |
10 | 200313003000121 |
11 | 5890a2a4054040 |
12 | 1a5720034a8221 |
13 | 87a0586c9cbab |
14 | 37672b5a72b7b |
15 | 1825903093dd1 |
hex | b62f01634139 |
200313003000121 has 32 divisors (see below), whose sum is σ = 219942345738240. Its totient is φ = 180924136012800.
The previous prime is 200313003000119. The next prime is 200313003000133. The reversal of 200313003000121 is 121000300313002.
It is a cyclic number.
It is not a de Polignac number, because 200313003000121 - 21 = 200313003000119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200313003000095 and 200313003000104.
It is not an unprimeable number, because it can be changed into a prime (200313003000151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9656886076 + ... + 9656906818.
It is an arithmetic number, because the mean of its divisors is an integer number (6873198304320).
Almost surely, 2200313003000121 is an apocalyptic number.
It is an amenable number.
200313003000121 is a deficient number, since it is larger than the sum of its proper divisors (19629342738119).
200313003000121 is a wasteful number, since it uses less digits than its factorization.
200313003000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30037.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 200313003000121 its reverse (121000300313002), we get a palindrome (321313303313123).
The spelling of 200313003000121 in words is "two hundred trillion, three hundred thirteen billion, three million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •