Base | Representation |
---|---|
bin | 11001000011110010000110… |
… | …101110011000011011111101 |
3 | 112110020002011112011221122122 |
4 | 121003302012232120123331 |
5 | 103421144334001333041 |
6 | 1030222142354052325 |
7 | 32133330215450114 |
oct | 3103620656303375 |
9 | 473202145157578 |
10 | 110211121121021 |
11 | 321313017471a8 |
12 | 1043b7a157a0a5 |
13 | 4965b306451cb |
14 | 1d30365020c7b |
15 | cb1c9e19dc4b |
hex | 643c86b986fd |
110211121121021 has 24 divisors (see below), whose sum is σ = 121288622775360. Its totient is φ = 99679149123840.
The previous prime is 110211121120981. The next prime is 110211121121041. The reversal of 110211121121021 is 120121121112011.
It is not a de Polignac number, because 110211121121021 - 210 = 110211121119997 is a prime.
It is a super-2 number, since 2×1102111211210212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110211121121041) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 118155161 + ... + 119084273.
It is an arithmetic number, because the mean of its divisors is an integer number (5053692615640).
Almost surely, 2110211121121021 is an apocalyptic number.
It is an amenable number.
110211121121021 is a deficient number, since it is larger than the sum of its proper divisors (11077501654339).
110211121121021 is an frugal number, since it uses more digits than its factorization.
110211121121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930197 (or 929676 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 110211121121021 its reverse (120121121112011), we get a palindrome (230332242233032).
The spelling of 110211121121021 in words is "one hundred ten trillion, two hundred eleven billion, one hundred twenty-one million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •