Base | Representation |
---|---|
bin | 101101100011000011110001… |
… | …001111101101010001111001 |
3 | 222021021112100100212121102212 |
4 | 231203003301033231101321 |
5 | 202224031031430041441 |
6 | 1550014202301304505 |
7 | 60123511051231310 |
oct | 5543036117552171 |
9 | 867245310777385 |
10 | 200321322112121 |
11 | 58912882a6a011 |
12 | 1a573745565135 |
13 | 87a12b1672c82 |
14 | 3767864887277 |
15 | 1825c3d5c5eeb |
hex | b630f13ed479 |
200321322112121 has 12 divisors (see below), whose sum is σ = 239325284644992. Its totient is φ = 164238599492616.
The previous prime is 200321322112019. The next prime is 200321322112123. The reversal of 200321322112121 is 121211223123002.
It is not a de Polignac number, because 200321322112121 - 218 = 200321321849977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (200321322112123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27048514001 + ... + 27048521406.
It is an arithmetic number, because the mean of its divisors is an integer number (19943773720416).
Almost surely, 2200321322112121 is an apocalyptic number.
It is an amenable number.
200321322112121 is a deficient number, since it is larger than the sum of its proper divisors (39003962532871).
200321322112121 is an equidigital number, since it uses as much as digits as its factorization.
200321322112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54097035460 (or 54097035437 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 200321322112121 its reverse (121211223123002), we get a palindrome (321532545235123).
The spelling of 200321322112121 in words is "two hundred trillion, three hundred twenty-one billion, three hundred twenty-two million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •