Base | Representation |
---|---|
bin | 11001000011111100010101… |
… | …000111100001100000000100 |
3 | 112110021010111122220100101212 |
4 | 121003330111013201200010 |
5 | 103421334330100323022 |
6 | 1030231200025510552 |
7 | 32134166250461543 |
oct | 3103742507414004 |
9 | 473233448810355 |
10 | 110222100011012 |
11 | 32135a25a76800 |
12 | 10441946342458 |
13 | 4966b9008b112 |
14 | 1d30ac719815a |
15 | cb21e2e6d3e2 |
hex | 643f151e1804 |
110222100011012 has 18 divisors (see below), whose sum is σ = 212018130394014. Its totient is φ = 50100954550240.
The previous prime is 110222100011003. The next prime is 110222100011077. The reversal of 110222100011012 is 210110001222011.
It can be written as a sum of positive squares in only one way, i.e., 86289496737796 + 23932603273216 = 9289214^2 + 4892096^2 .
It is a super-2 number, since 2×1102221000110122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 113865805313 + ... + 113865806280.
Almost surely, 2110222100011012 is an apocalyptic number.
It is an amenable number.
110222100011012 is a deficient number, since it is larger than the sum of its proper divisors (101796030383002).
110222100011012 is a wasteful number, since it uses less digits than its factorization.
110222100011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227731611619 (or 227731611606 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110222100011012 its reverse (210110001222011), we get a palindrome (320332101233023).
The spelling of 110222100011012 in words is "one hundred ten trillion, two hundred twenty-two billion, one hundred million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •