Base | Representation |
---|---|
bin | 11001000010011110001011… |
… | …001010100101101111110101 |
3 | 112102220110112220212021101022 |
4 | 121002132023022211233311 |
5 | 103413210302313424341 |
6 | 1030112520053510525 |
7 | 32123660032633625 |
oct | 3102361312455765 |
9 | 472813486767338 |
10 | 110121001311221 |
11 | 320a706643424a |
12 | 10426230642445 |
13 | 495a49aa64774 |
14 | 1d29c56256885 |
15 | cae777557e4b |
hex | 64278b2a5bf5 |
110121001311221 has 16 divisors (see below), whose sum is σ = 116483903432064. Its totient is φ = 103889375149824.
The previous prime is 110121001311173. The next prime is 110121001311241. The reversal of 110121001311221 is 122113100121011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110121001311221 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 110121001311221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110121001311241) 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, 334522310 + ... + 334851336.
It is an arithmetic number, because the mean of its divisors is an integer number (7280243964504).
Almost surely, 2110121001311221 is an apocalyptic number.
It is an amenable number.
110121001311221 is a deficient number, since it is larger than the sum of its proper divisors (6362902120843).
110121001311221 is a wasteful number, since it uses less digits than its factorization.
110121001311221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528460.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 110121001311221 its reverse (122113100121011), we get a palindrome (232234101432232).
The spelling of 110121001311221 in words is "one hundred ten trillion, one hundred twenty-one billion, one million, three hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •