Base | Representation |
---|---|
bin | 101111110001100010001111… |
… | …000111000101100101111001 |
3 | 1000112221112022120001202221022 |
4 | 233301202033013011211321 |
5 | 210014434241441320441 |
6 | 2022512113533552225 |
7 | 62154051133525316 |
oct | 5761421707054571 |
9 | 1015845276052838 |
10 | 210112201120121 |
11 | 60a480a1a11613 |
12 | 1b69519b045675 |
13 | 9031659948731 |
14 | 39c56b03c5d0d |
15 | 194577946884b |
hex | bf188f1c5979 |
210112201120121 has 32 divisors (see below), whose sum is σ = 222760454676480. Its totient is φ = 197628772492800.
The previous prime is 210112201120061. The next prime is 210112201120229. The reversal of 210112201120121 is 121021102211012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210112201120121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 210112201120121.
It is not an unprimeable number, because it can be changed into a prime (210112201110121) 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, 2855408096 + ... + 2855481678.
It is an arithmetic number, because the mean of its divisors is an integer number (6961264208640).
Almost surely, 2210112201120121 is an apocalyptic number.
It is an amenable number.
210112201120121 is a deficient number, since it is larger than the sum of its proper divisors (12648253556359).
210112201120121 is a wasteful number, since it uses less digits than its factorization.
210112201120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75797.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 210112201120121 its reverse (121021102211012), we get a palindrome (331133303331133).
The spelling of 210112201120121 in words is "two hundred ten trillion, one hundred twelve billion, two hundred one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •