Base | Representation |
---|---|
bin | 11001000010011111001101… |
… | …110110111001010110101001 |
3 | 112102220120102220021211120202 |
4 | 121002133031312321112221 |
5 | 103413220100234101441 |
6 | 1030113223104001545 |
7 | 32124026540341550 |
oct | 3102371566712651 |
9 | 472816386254522 |
10 | 110122120222121 |
11 | 320a758aa955a7 |
12 | 104264a33002b5 |
13 | 495a618806c17 |
14 | 1d29d20ab8d97 |
15 | cae7e08c719b |
hex | 6427cddb95a9 |
110122120222121 has 16 divisors (see below), whose sum is σ = 131335695436800. Its totient is φ = 90279627018768.
The previous prime is 110122120222117. The next prime is 110122120222157. The reversal of 110122120222121 is 121222021221011.
It is a cyclic number.
It is not a de Polignac number, because 110122120222121 - 22 = 110122120222117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110122120222093 and 110122120222102.
It is not an unprimeable number, because it can be changed into a prime (110122120212121) 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, 23743151 + ... + 27999668.
It is an arithmetic number, because the mean of its divisors is an integer number (8208480964800).
Almost surely, 2110122120222121 is an apocalyptic number.
It is an amenable number.
110122120222121 is a deficient number, since it is larger than the sum of its proper divisors (21213575214679).
110122120222121 is a wasteful number, since it uses less digits than its factorization.
110122120222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51756068.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 110122120222121 its reverse (121222021221011), we get a palindrome (231344141443132).
The spelling of 110122120222121 in words is "one hundred ten trillion, one hundred twenty-two billion, one hundred twenty million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •