Base | Representation |
---|---|
bin | 101101101111110110010011… |
… | …101101101001111011111001 |
3 | 222101101112221100120022001221 |
4 | 231233312103231221323321 |
5 | 202332431023111400441 |
6 | 1551530034451112041 |
7 | 60244144021223053 |
oct | 5557662355517371 |
9 | 871345840508057 |
10 | 201200221200121 |
11 | 59121597652360 |
12 | 1a695b4aba2621 |
13 | 883613a644620 |
14 | 37981dd68c8d3 |
15 | 183da2d3c08d1 |
hex | b6fd93b69ef9 |
201200221200121 has 16 divisors (see below), whose sum is σ = 238715432440128. Its totient is φ = 167167669752000.
The previous prime is 201200221200067. The next prime is 201200221200127. The reversal of 201200221200121 is 121002122002102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201200221200121 - 29 = 201200221199609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201200221200095 and 201200221200104.
It is not an unprimeable number, because it can be changed into a prime (201200221200127) 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, 6965305131 + ... + 6965334016.
It is an arithmetic number, because the mean of its divisors is an integer number (14919714527508).
Almost surely, 2201200221200121 is an apocalyptic number.
It is an amenable number.
201200221200121 is a deficient number, since it is larger than the sum of its proper divisors (37515211240007).
201200221200121 is a wasteful number, since it uses less digits than its factorization.
201200221200121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13930639272.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201200221200121 its reverse (121002122002102), we get a palindrome (322202343202223).
The spelling of 201200221200121 in words is "two hundred one trillion, two hundred billion, two hundred twenty-one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •