Base | Representation |
---|---|
bin | 110011010100010000… |
… | …0010000110011011001 |
3 | 101112110010000121111212 |
4 | 1212220200100303121 |
5 | 3301143002241441 |
6 | 122343054232505 |
7 | 10650613563500 |
oct | 1465040206331 |
9 | 345403017455 |
10 | 110201212121 |
11 | 42810790820 |
12 | 194361b5735 |
13 | a5130b9b30 |
14 | 5495bdd837 |
15 | 2ceeae0eeb |
hex | 19a8810cd9 |
110201212121 has 48 divisors (see below), whose sum is σ = 151098171840. Its totient is φ = 79005870720.
The previous prime is 110201212111. The next prime is 110201212139. The reversal of 110201212121 is 121212102011.
It is not a de Polignac number, because 110201212121 - 218 = 110200949977 is a prime.
110201212121 is a modest number, since divided by 212121 gives 110201 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 110201212096 and 110201212105.
It is not an unprimeable number, because it can be changed into a prime (110201212111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2125535 + ... + 2176763.
It is an arithmetic number, because the mean of its divisors is an integer number (3147878580).
Almost surely, 2110201212121 is an apocalyptic number.
110201212121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110201212121 is a deficient number, since it is larger than the sum of its proper divisors (40896959719).
110201212121 is a wasteful number, since it uses less digits than its factorization.
110201212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51574 (or 51567 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110201212121 its reverse (121212102011), we get a palindrome (231413314132).
The spelling of 110201212121 in words is "one hundred ten billion, two hundred one million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •